Number of partitions of 3n into n parts from the set {0, 1,.., 6} (repetitions admissible).
1, 1, 4, 8, 18, 32, 58, 94, 151, 227, 338, 480, 676, 920, 1242, 1636, 2137, 2739, 3486
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
.