login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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

%I

%S 1,10,23,40,60,83,110,141,175,213,253,298,345,396,451,508,570,634,702,

%T 773,847,925,1006,1090,1178,1269,1363,1460,1561,1665,1773,1883,1997,

%U 2114,2235,2359,2486,2616,2750,2887,3027,3170,3317,3467,3620,3777,3936

%N Smallest m such that number of distinct partitions of m exceeds 10^n.

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

%Y Cf. A000009.

%K nonn

%O 0,2

%A _Robert G. Wilson v_, Jul 06 2002

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 October 28 01:29 EDT 2021. Contains 348305 sequences. (Running on oeis4.)