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!)
A284645 Number of partitions of n^2 that are the sum of n not necessarily distinct partitions of n. 2
1, 1, 3, 10, 55, 266, 1974, 11418, 88671, 613756, 4884308 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = A213086(n,n).
a(n) <= binomial(A000041(n)+n-1,n) with equality only for n<4.
EXAMPLE
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.
Sequence in context: A342966 A359976 A034234 * A081721 A013009 A301920
KEYWORD
nonn,more
AUTHOR
Alois P. Heinz, Apr 03 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 08:56 EDT 2024. Contains 371934 sequences. (Running on oeis4.)