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.

A119269 Table by antidiagonals: number of m-dimensional partitions of n up to conjugacy, for n >= 1, m >= 0.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 1, 4, 4, 2, 1, 1, 1, 6, 6, 4, 2, 1, 1, 1, 8, 11, 7, 4, 2, 1, 1, 1, 12, 19, 13, 7, 4, 2, 1, 1, 1, 16, 33, 25, 14, 7, 4, 2, 1, 1, 1, 22, 55, 49, 27, 14, 7, 4, 2, 1, 1, 1, 29, 95, 93, 55, 28, 14, 7, 4, 2, 1, 1, 1, 40, 158, 181, 111, 57, 28, 14, 7, 4, 2, 1, 1
Offset: 1

Views

Author

Keywords

Comments

Partitions are considered as generalized Ferrers diagrams; any permutation of the axes produces a conjugate.
Transposed table is A119338. - Max Alekseyev, May 14 2006

Examples

			Table starts:
  1, 1,  1,  1,  1
  1, 1,  1,  1,  1
  1, 2,  2,  2,  2
  1, 3,  4,  4,  4
  1, 4,  6,  7,  7
  1, 6, 11, 13, 14
		

Crossrefs

Formula

a(n,m) = a(n,n-2) for m >= n-1.

Extensions

More terms from Max Alekseyev, May 14 2006