A198194 Greatest number k such that p(k) <= n, p(k) being the number of unrestricted partitions of k.

1, 2, 3, 3, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12

Offset

1,2

Comments

Sort of "InversePartitionsP".

Links

Table of n, a(n) for n=1..100.

Mathematica

a[n_] := For[k=1, True, k++, If[PartitionsP[k]>n, Return[k-1]]]; Table[ a[n], {n, 100}]

Prog

(PARI) a(n)=my(k=1); while(numbpart(k)<=n, k++); k-1 \\ Charles R Greathouse IV, Jan 14 2013

Crossrefs

Cf. A000041.

Sequence in context: A362692 A341053 A126236 * A073047 A038567 A185195

Adjacent sequences: A198191 A198192 A198193 * A198195 A198196 A198197

Keyword

nonn

Author

Jean-François Alcover, Jan 14 2013

Status

approved