login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A284911 Number of partitions of n^2 that are the sum of n not necessarily distinct partitions of n into distinct parts. 1
1, 1, 1, 4, 5, 21, 84, 330, 1287, 11440, 92378, 537472, 4694482 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

Table of n, a(n) for n=0..12.

FORMULA

a(n) <= binomial(A000009(n)+n-1,n) with equality only for n < 11.

EXAMPLE

a(5) = 21: 55555, 555532, 555541, 5553322, 5554321, 5554411, 55333222, 55433221, 55443211, 55444111, 533332222, 543332221, 544332211, 544432111, 544441111, 3333322222, 4333322221, 4433322211, 4443322111, 4444321111, 4444411111.

CROSSREFS

Cf. A000009, A002054, A007318, A284645.

Sequence in context: A109452 A232665 A178625 * A091130 A141447 A129346

Adjacent sequences:  A284908 A284909 A284910 * A284912 A284913 A284914

KEYWORD

nonn,more

AUTHOR

Alois P. Heinz, Apr 05 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 27 03:21 EDT 2020. Contains 337380 sequences. (Running on oeis4.)