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!)
A283111 Number of partitions of 2^n into n parts. 1

%I #15 Mar 10 2017 14:55:26

%S 0,1,2,5,34,480,17180,1652171,461346215,396507897335,1093817527528804,

%T 9967640563717565125,306039783996035518230753,

%U 32112037153481933712774822566,11641561173234351448063113301394401

%N Number of partitions of 2^n into n parts.

%F a(n) = P(2^n,n), where P(x, y) is the number of partitions of x into y parts.

%F a(n) = A008284(2^n,n). - _R. J. Mathar_, Mar 10 2017

%t a[n_] := SeriesCoefficient[1/Product[1 - x^k, {k, 1, n}], {x, 0, 2^n - n}]; Table[an = a[n]; Print["a(", n, ") = ", an]; an, {n, 0, 14}] (* _Jean-François Alcover_, Mar 01 2017 *)

%K nonn,more

%O 0,3

%A _Francois Alcover_, Feb 28 2017

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 April 24 05:26 EDT 2024. Contains 371918 sequences. (Running on oeis4.)