arXiv (All)
open access
Initial Runs in Integer Compositions: Lambert Series and Generalized Divisor Sums
We study the initial run of equal adjacent parts in an integer composition. For a composition alpha, let P(alpha) be the common value of the parts in the initial run, let K(alpha) be the number of parts in that run, and set S(alpha)=P(alpha)K(alpha). We obtain exact finite formulas for the joint par
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Multiplicative independence in the sequence of $k$-generalized Pell numbers#1034735
- Sharp order-preserving integer models for short additive equalities#986537
- A Uniqueness Theorem for Exact Separable Log-Partition Decompositions#677695
- A Uniqueness Theorem for Exact Separable Log-Partition Decompositions#674494
- Logical-arithmetic entropy and the principle of maximum entropy Irreversibility and computational complexity#96886
Record · ID 1104513
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive