Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068413
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A068413
%S A068413 1,2,5,22,231,8349,1741630,4351078600,365749566870782,
%T A068413 4453575699570940947378,61847822068260244309086870983975,
%U A068413 18116048323611252751541173214616030020513022685,6927233917602120527467409170319882882996950147283323368445315\
               320451
%N A068413 a(n) = number of partitions of 2^n.
%H A068413 Henry Bottomley, <a href="http://www.btinternet.com/~se16/js/partitions.htm">
               Partition calculators using java applets</a>
%H A068413 <a href="Sindx_Par.html#part">Index entries for sequences related to 
               partitions</a>
%F A068413 a(n) =A000041(A000079(n))
%e A068413 a(2)=5 since there are 5 partitions of 2^2=4: 4, 3+1, 2+2, 2+1+1, 1+1+1+1+1.
%t A068413 Table[ PartitionsP[2^n], {n, 0, 12}]
%Y A068413 Cf. A000041, A018819.
%Y A068413 Sequence in context: A005203 A090450 A137099 this_sequence A137069 A050994 
               A034384
%Y A068413 Adjacent sequences: A068410 A068411 A068412 this_sequence A068414 A068415 
               A068416
%K A068413 nonn
%O A068413 0,2
%A A068413 Henry Bottomley (se16(AT)btinternet.com), Mar 03 2002

    
page 1

Search completed in 0.001 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