|
Search: id:A064682
|
|
|
| A064682 |
|
Number of partitions of n^n into distinct parts. |
|
+0
1
|
|
| 1, 1, 2, 192, 11784471548, 49119584729121300101049137845273511977280
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
MATHEMATICA
|
a[n_]:=PartitionsQ[n^n]; lst={}; Do[AppendTo[lst, a[n]], {n, 0, 3!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 03 2008]
|
|
PROGRAM
|
(PARI) a(n) = polcoeff(prod(k=1, n, 1+x^k, 1+x*O(x^n)), n) for(n=0, 23, print(a(n^n)))
|
|
CROSSREFS
|
Cf. A000009.
Sequence in context: A142890 A103404 A151709 this_sequence A139949 A103429 A143659
Adjacent sequences: A064679 A064680 A064681 this_sequence A064683 A064684 A064685
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Oct 10 2001
|
|
EXTENSIONS
|
Next term is 841043474026501008459...7883814176 (166 digits) - David Wasserman (wasserma(AT)spawar.navy.mil), Aug 01 2002
|
|
|
Search completed in 0.002 seconds
|
