|
Search: id:A062881
|
|
|
| A062881 |
|
Number of partitions of n^2 into exactly n nonzero parts, such that there are at most one 1's, two 2's... n-1 n-1's, n n's, n-1 n+1's... two 2n-2's and one 2n-1. |
|
+0
1
|
|
| 1, 2, 5, 17, 66, 295, 1408, 7103, 37140, 199915, 1100752, 6174851
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
All monomials in "formal determinant" of Hankel matrix, (i.e. including those with zero coefficient due to cancellation). Upper bound for A019448.
|
|
EXAMPLE
|
a(3) = 5 since the 3-part partitions of 9 meeting the budget for parts (i.e. at most 1 1's, 2 2s, 3 3s, 2 4s and 1 5s) are 1+3+5, 1+4+4, 2+2+5, 2+3+4 and 3+3+3.
|
|
CROSSREFS
|
Cf. A019448.
Sequence in context: A123166 A052539 A008932 this_sequence A122206 A104082 A166474
Adjacent sequences: A062878 A062879 A062880 this_sequence A062882 A062883 A062884
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
Marc LeBrun (mlb(AT)well.com), Jun 26 2001
|
|
EXTENSIONS
|
Corrected by Vladeta Jovovic (vladeta(AT)EUnet.yu) Jul 01, 2001.
Definition corrected by N. J. A. Sloane, Mar 12 2009
|
|
|
Search completed in 0.002 seconds
|
