|
| |
|
|
A068413
|
|
a(n) = number of partitions of 2^n.
|
|
5
|
|
|
|
1, 2, 5, 22, 231, 8349, 1741630, 4351078600, 365749566870782, 4453575699570940947378, 61847822068260244309086870983975, 18116048323611252751541173214616030020513022685, 6927233917602120527467409170319882882996950147283323368445315320451
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
Table of n, a(n) for n=0..12.
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: A193660 A090450 A137099 * A137069 A050994 A034384
Adjacent sequences: A068410 A068411 A068412 * A068414 A068415 A068416
|
|
|
KEYWORD
|
nonn,changed
|
|
|
AUTHOR
|
Henry Bottomley, Mar 03 2002
|
|
|
STATUS
|
approved
|
| |
|
|
