login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A284824
Number of partitions of n copies of n^2 into distinct parts.
1
1, 1, 1, 13, 401, 93151, 88853970, 482430702570
OFFSET
0,4
FORMULA
a(n) = 1/n! * [Product_{i=1..n} x_i^(n^2)] Product_{j>0} (1+Sum_{i=1..n} x_i^j).
a(n) = A258280(n^2,n).
EXAMPLE
a(3) = 13: [9;8,1;7,2], [9;8,1;6,3], [9;8,1;5,4], [9;8,1;4,3,2], [9;7,2;6,3], [9;7,2;5,4], [9;7,2;5,3,1], [9;6,3;5,4], [9;5,4;6,2,1], [8,1;7,2;6,3], [8,1;7,2;5,4], [8,1;6,3;5,4], [7,2;6,3;5,4].
CROSSREFS
Cf. A258280.
Sequence in context: A286189 A280553 A162446 * A075672 A069876 A126086
KEYWORD
nonn,more
AUTHOR
Alois P. Heinz, Apr 03 2017
STATUS
approved