Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072245
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072245 Smallest m such that number of distinct partitions of m exceeds 10^n. +0
1
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; listen)
OFFSET

0,2

MATHEMATICA

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

CROSSREFS

Cf. A000009.

Adjacent sequences: A072242 A072243 A072244 this_sequence A072246 A072247 A072248

Sequence in context: A054095 A125618 A140674 this_sequence A135277 A102089 A133503

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 06 2002

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 October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research