cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A284824 Number of partitions of n copies of n^2 into distinct parts.

Original entry on oeis.org

1, 1, 1, 13, 401, 93151, 88853970, 482430702570
Offset: 0

Views

Author

Alois P. Heinz, Apr 03 2017

Keywords

Examples

			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.

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).