Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 28 min ago
PreprintarXiv licencearXiv

The range and omitted values of a certain sequence involving the partition function

  • Kalyan Chakraborty
  • Alisha Kazi
  • Manoj Upreti
Open at sourcePDFDOICite

Abstract

Let p(n) denote the ordinary partition function. Motivated by analogous questions concerning Euler's totient function and its complementary counting function, we study the range of the partition-derived sequence p(n)−n. We give combinatorial interpretations of this sequence and investigate both the attained and omitted positive integers. We obtain exact and asymptotic information about the gaps between consecutive attained values and show that the range is remarkably sparse: its counting function has order (log x)2, and consequently the range has natural density zero. We also extend the discussion to partitions whose Durfee square has side at least a fixed positive integer.

Related

  1. On Certain Congruences for Partition k-Tuples with $5$-Cores
    Saikat Maity
    arXivPreprintarXiv licenceFull textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  2. Certain families of series involving Hurwitz and Lerch zeta functions
    Dora Pokaz, Mihaela Ribicic Penava, Yilmaz Simsek
    arXivPreprintCC BY-NC-ND 4.0Full textAnalysis & PDEsarXiv
  3. Different approach to certain problems in univalent function theory
    Milutin Obradović, Nikola Tuneski
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
  4. On short averages of the Fibonacci partition function
    Sam Chow, Owen Jones
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryarXiv
  5. The two-block odd partition function
    Mircea Merca
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{chakraborty2026range,
  title = {{The range and omitted values of a certain sequence involving the partition function}},
  author = {Kalyan Chakraborty and Alisha Kazi and Manoj Upreti},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.08822},
  eprint = {2609.08822},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.08822},
}
RIS
TY  - UNPB
TI  - The range and omitted values of a certain sequence involving the partition function
AU  - Kalyan Chakraborty
AU  - Alisha Kazi
AU  - Manoj Upreti
PY  - 2026
DA  - 2026/09/08
PB  - arXiv
DO  - 10.48550/arxiv.2609.08822
UR  - https://arxiv.org/abs/2609.08822
AB  - Let p(n) denote the ordinary partition function. Motivated by analogous questions concerning Euler's totient function and its complementary counting function, we study the range of the partition-derived sequence p(n)−n. We give combinatorial interpretations of this sequence and investigate both the attained and omitted positive integers. We obtain exact and asymptotic information about the gaps between consecutive attained values and show that the range is remarkably sparse: its counting function has order (log x)^2, and consequently the range has natural density zero. We also extend the discussion to partitions whose Durfee square has side at least a fixed positive integer.
ER  -