login
The OEIS is supported by the many generous donors to the OEIS 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

%I #12 Apr 14 2017 23:59:39

%S 1,1,1,4,5,21,84,330,1287,11440,92378,537472,4694482

%N Number of partitions of n^2 that are the sum of n not necessarily distinct partitions of n into distinct parts.

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

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

%Y Cf. A000009, A002054, A007318, A284645.

%K nonn,more

%O 0,4

%A _Alois P. Heinz_, Apr 05 2017

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 13:27 EDT 2024. Contains 371971 sequences. (Running on oeis4.)