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.

Showing 1-1 of 1 results.

A284645 Number of partitions of n^2 that are the sum of n not necessarily distinct partitions of n.

Original entry on oeis.org

1, 1, 3, 10, 55, 266, 1974, 11418, 88671, 613756, 4884308
Offset: 0

Views

Author

Alois P. Heinz, Apr 03 2017

Keywords

Examples

			a(0) = 1: the empty partition.
a(1) = 1: 1.
a(2) = 3: 22, 211, 1111.
a(3) = 10: 333, 3321, 32211, 33111, 222111, 321111, 2211111, 3111111, 21111111, 111111111. (Two of the A206226(3) = 12 partitions are not counted here: 3222, 22221.)
		

Crossrefs

Main diagonal of A213086.

Formula

a(n) = A213086(n,n).
a(n) <= binomial(A000041(n)+n-1,n) with equality only for n<4.
Showing 1-1 of 1 results.