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”).

A079058
Least k such that A025591(k)>p(n) (p(n)=the n-th partition number).
0
1, 3, 5, 6, 7, 8, 9, 9, 10, 11, 11, 12, 12, 13, 13, 14, 14, 14, 15, 15, 16, 16, 16, 17, 17, 18, 18, 18, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 22, 22, 22, 22, 23, 23, 23, 24, 24, 24, 24, 25, 25, 25, 25, 26, 26, 26, 26, 27, 27, 27, 27, 28, 28, 28, 28, 28, 29, 29, 29, 29, 30, 30
OFFSET
1,2
FORMULA
a(n) is asymptotic to C*sqrt(n) with 3.5<C<3.6... Is it true that C = exp(Pi/sqrt(6))?
PROG
(PARI) a(n)=if(n<0, 0, k=1; while(polcoeff(prod(i=1, k, 1+x^i), k*(k+1)\4)-polcoeff(1/eta(x), n)<0, k++); k)
CROSSREFS
Cf. A000041.
Sequence in context: A196008 A004220 A202308 * A036496 A196112 A009004
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Feb 02 2003
STATUS
approved