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!)
A097984 Largest m such that p(m)< 10^n, where p(m) is the partition function A000041(m). 0
5, 12, 21, 32, 45, 60, 76, 94, 114, 135, 159, 184, 210, 239, 269, 301, 334, 369, 406, 444, 485, 526, 570, 615, 662, 710, 760, 812, 866, 921, 977, 1036, 1096, 1158, 1221, 1286, 1353, 1421, 1491, 1562, 1636, 1710, 1787, 1865, 1945 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
MATHEMATICA
For[n = 1, n < 2000, n++, If[Floor[Log[10, PartitionsP[n]]] + 1 == Floor[Log[10, PartitionsP[n + 1]]], Print[n]]] (Steinerberger)
CROSSREFS
Cf. A000041.
Sequence in context: A121291 A272012 A272451 * A028347 A346379 A354399
KEYWORD
nonn
AUTHOR
Lekraj Beedassy, Sep 07 2004
EXTENSIONS
More terms from Stefan Steinerberger, Feb 03 2006
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 April 29 05:57 EDT 2024. Contains 372097 sequences. (Running on oeis4.)