The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064681 a(n) = number of partitions of n! into distinct parts. 1

%I #15 Dec 15 2017 17:35:41

%S 1,1,1,4,122,2194432,1860799032530519872,

%T 26520691877985842130274557505490676978655683245437940

%N a(n) = number of partitions of n! into distinct parts.

%F a(n) = A000009(A000142(n)). - _Michel Marcus_, Jan 11 2015

%t a[n_]:=PartitionsQ[n! ];lst={};Do[AppendTo[lst,a[n]],{n,0,8}];lst (* _Vladimir Joseph Stephan Orlovsky_, Dec 22 2008 *)

%o (PARI) a(n) = polcoeff(prod(k=1,n,1+x^k,1+x*O(x^n)), n) for(n=0,23,print(a(n!)))

%Y Cf. A000009.

%K nonn

%O 0,4

%A _Jason Earls_, Oct 10 2001

%E One more term from _Vladeta Jovovic_, Oct 13 2001

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 16 10:52 EDT 2024. Contains 372552 sequences. (Running on oeis4.)