The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A064681 a(n) = number of partitions of n! into distinct parts. 1
 1, 1, 1, 4, 122, 2194432, 1860799032530519872, 26520691877985842130274557505490676978655683245437940 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS Table of n, a(n) for n=0..7. FORMULA a(n) = A000009(A000142(n)). - Michel Marcus, Jan 11 2015 MATHEMATICA a[n_]:=PartitionsQ[n! ]; lst={}; Do[AppendTo[lst, a[n]], {n, 0, 8}]; lst (* Vladimir Joseph Stephan Orlovsky, Dec 22 2008 *) PROG (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. Sequence in context: A268050 A268006 A144993 * A219871 A263550 A232592 Adjacent sequences: A064678 A064679 A064680 * A064682 A064683 A064684 KEYWORD nonn AUTHOR Jason Earls, Oct 10 2001 EXTENSIONS One more term from Vladeta Jovovic, Oct 13 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 1 22:38 EDT 2023. Contains 365828 sequences. (Running on oeis4.)