|
Search: id:A064681
|
|
|
| A064681 |
|
Number of partitions of n! into distinct parts. |
|
+0
2
|
|
| 1, 1, 1, 4, 122, 2194432, 1860799032530519872, 26520691877985842130274557505490676978655683245437940
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
MATHEMATICA
|
a[n_]:=PartitionsQ[n! ]; lst={}; Do[AppendTo[lst, a[n]], {n, 0, 8}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 22 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!)))
|
|
CROSSREFS
|
Cf. A000009.
Adjacent sequences: A064678 A064679 A064680 this_sequence A064682 A064683 A064684
Sequence in context: A144508 A080179 A144993 this_sequence A005936 A090082 A068891
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jason Earls (zevi_35711(AT)yahoo.com), Oct 10 2001
|
|
EXTENSIONS
|
One more term from Vladeta Jovovic (vladeta(AT)eunet.rs), Oct 13 2001
|
|
|
Search completed in 0.002 seconds
|
