login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072245 Smallest m such that number of distinct partitions of m exceeds 10^n. 0
1, 10, 23, 40, 60, 83, 110, 141, 175, 213, 253, 298, 345, 396, 451, 508, 570, 634, 702, 773, 847, 925, 1006, 1090, 1178, 1269, 1363, 1460, 1561, 1665, 1773, 1883, 1997, 2114, 2235, 2359, 2486, 2616, 2750, 2887, 3027, 3170, 3317, 3467, 3620, 3777, 3936 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
MATHEMATICA
f[n_] := Block[{m = 1}, While[ PartitionsQ[m] < 10^n, m++ ]; m]; Table[ f[n], {n, 0, 50}]
CROSSREFS
Cf. A000009.
Sequence in context: A154033 A275238 A140674 * A135277 A156202 A266080
KEYWORD
nonn
AUTHOR
Robert G. Wilson v, Jul 06 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 10 19:29 EDT 2024. Contains 372388 sequences. (Running on oeis4.)