Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072212
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A072212
%S A072212 6,13,22,33,46,61,77,95,115,136,160,185,211,240,270,302,335,370,407,
%T A072212 445,486,527,571,616,663,711,761,813,867,922,978,1037,1097,1159,1222,
%U A072212 1287,1354,1422,1492,1563,1637,1711,1788,1866,1946,2027,2110,2195,2281
%N A072212 Smallest m such that number of partitions of m exceeds 10^n.
%t A072212 f[n_] := Block[{m = 1}, While[ PartitionsP[m] < 10^n, m++ ]; m]; Table[ 
               f[n], {n, 0, 50}]
%Y A072212 Cf. A000041.
%Y A072212 Sequence in context: A046040 A056115 A101247 this_sequence A028872 A049718 
               A036707
%Y A072212 Adjacent sequences: A072209 A072210 A072211 this_sequence A072213 A072214 
               A072215
%K A072212 nonn
%O A072212 1,1
%A A072212 Jeff Burch (gburch(AT)erols.com), Jul 03 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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research