Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097984
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097984 Largest m such that p(m)< 10^n, where p(m) is the partition function A000041(m). +0
1
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; listen)
OFFSET

1,1

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: A086570 A063559 A121291 this_sequence A028347 A038794 A131976

Adjacent sequences: A097981 A097982 A097983 this_sequence A097985 A097986 A097987

KEYWORD

nonn

AUTHOR

Lekraj Beedassy (blekraj(AT)yahoo.com), Sep 07 2004

EXTENSIONS

More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Feb 03 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research