login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A101295 Number of partitions of n!. 0

%I

%S 1,1,2,11,1575,1844349560,153758476658245881594406593,

%T 347537071782505941949439171855284853031279455482877609142244398412144336038

%N Number of partitions of n!.

%C The next term is too large to include. - _Robert G. Wilson v_, Dec 22 2004

%F a(n) = A000041(A000142(n)). - _Michel Marcus_, Mar 25 2015

%e P(3!) = 11; P(4!) = 1575.

%t Table[ PartitionsP[n!], {n, 8}] (* _Robert G. Wilson v_, Dec 23 2004 *)

%o (MuPAD) combinat::partitions::count(i!) $i=0..8 // _Zerinvary Lajos_, Apr 16 2007

%o (PARI) a(n) = numbpart(n!); \\ _Michel Marcus_, Mar 25 2015

%o (MAGMA) a:= func<n | NumberOfPartitions(Factorial(n))>; [a(n): n in [0..8]]; // _Vincenzo Librandi_, Apr 06 2015

%K nonn

%O 0,3

%A _Parthasarathy Nambi_, Dec 21 2004

%E More terms from _Robert G. Wilson v_, Dec 22 2004

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 22 10:03 EDT 2019. Contains 325219 sequences. (Running on oeis4.)