Number of partitions of n^2 into up to n parts each no more than 2n, or of n(3n+1)/2 into exactly n distinct parts each no more than 3n.
1, 1, 3, 8, 33, 141, 676, 3370, 17575, 94257, 517971, 2900900, 16509188, 95220378
3 seqfan posts
Sun Jan 2 20:42:19 CET 2011 [seqfan] Re: T(n, k)=Number of nondecreasing arrangements of n numbers in -k..k with sum zero
Sun Jan 2 19:46:21 CET 2011 [seqfan] Re: T(n, k)=Number of nondecreasing arrangements of n numbers in -k..k with sum zero
Tue Dec 14 01:40:21 CET 2010 [seqfan] T(n, k)=Number of nondecreasing arrangements of n numbers in -k..k with sum zero
Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword
Links to OEIS content are included according to
The OEIS End-User License Agreement
.