login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A360635
a(n) is the smallest nonnegative integer that satisfies p(a(n)+1) - p(a(n)) >= n, where p denotes the number partition function.
0
0, 1, 3, 5, 5, 7, 7, 7, 8, 9, 9, 9, 9, 10, 10, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 17, 17
OFFSET
0,3
COMMENTS
Conjecture: except for the values 2, 4 and 6, this sequence includes all the nonnegative integers.
LINKS
Christoph Koutschan, Ali K. Uncu, and Elaine Wong, A Unified Approach to Unimodality of Gaussian Polynomials, arXiv:2302.04067 [cs.SC], 2023.
MATHEMATICA
a={}; For[n=0, n<=68, n++, k=0; While[PartitionsP[k+1]-PartitionsP[k]<n, k++]; AppendTo[a, k]]; a
PROG
(PARI) a(n) = my(k=0); while (numbpart(k+1) - numbpart(k) < n, k++); k; \\ Michel Marcus, Feb 15 2023
CROSSREFS
KEYWORD
nonn
AUTHOR
Stefano Spezia, Feb 14 2023
STATUS
approved