login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A238461 Greatest number k such that A000009(k) <= n. 1
2, 4, 5, 6, 7, 8, 8, 9, 9, 10, 10, 11, 11, 11, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Inverse of A000009, the sequence of "restricted" partitions (partitions of integers into distinct parts).

LINKS

Jean-François Alcover, Table of n, a(n) for n = 1..1000

EXAMPLE

q(12) = 15, therefore a(15) = 12.

MATHEMATICA

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

CROSSREFS

Cf. A000009, A000041, A198194.

Sequence in context: A287076 A100006 A196262 * A195994 A182815 A196252

Adjacent sequences:  A238458 A238459 A238460 * A238462 A238463 A238464

KEYWORD

nonn

AUTHOR

Jean-François Alcover, Feb 27 2014

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 12 07:31 EST 2019. Contains 329948 sequences. (Running on oeis4.)