|
Search: id:A068413
|
|
|
| A068413 |
|
a(n) = number of partitions of 2^n. |
|
+0
6
|
|
| 1, 2, 5, 22, 231, 8349, 1741630, 4351078600, 365749566870782, 4453575699570940947378, 61847822068260244309086870983975, 18116048323611252751541173214616030020513022685, 6927233917602120527467409170319882882996950147283323368445315320451
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
Henry Bottomley, Partition calculators using java applets
Index entries for sequences related to partitions
|
|
FORMULA
|
a(n) =A000041(A000079(n))
|
|
EXAMPLE
|
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.
|
|
MATHEMATICA
|
Table[ PartitionsP[2^n], {n, 0, 12}]
|
|
CROSSREFS
|
Cf. A000041, A018819.
Sequence in context: A005203 A090450 A137099 this_sequence A137069 A050994 A034384
Adjacent sequences: A068410 A068411 A068412 this_sequence A068414 A068415 A068416
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), Mar 03 2002
|
|
|
Search completed in 0.003 seconds
|
