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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072212 Smallest m such that number of partitions of m exceeds 10^n. 1
6, 13, 22, 33, 46, 61, 77, 95, 115, 136, 160, 185, 211, 240, 270, 302, 335, 370, 407, 445, 486, 527, 571, 616, 663, 711, 761, 813, 867, 922, 978, 1037, 1097, 1159, 1222, 1287, 1354, 1422, 1492, 1563, 1637, 1711, 1788, 1866, 1946, 2027, 2110, 2195, 2281 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

MATHEMATICA

f[n_] := Block[{m = 1}, While[ PartitionsP[m] < 10^n, m++ ]; m]; Table[ f[n], {n, 0, 50}]

CROSSREFS

Cf. A000041.

Sequence in context: A173358 A101247 A243655 * A028872 A049718 A036707

Adjacent sequences:  A072209 A072210 A072211 * A072213 A072214 A072215

KEYWORD

nonn

AUTHOR

Jeff Burch, Jul 03 2002

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 14 21:25 EST 2017. Contains 296020 sequences.