OFFSET
1,9
COMMENTS
LINKS
G. E. Andrews, M. Beck and N. Robbins, Partitions with fixed differences between largest and smallest parts, arXiv:1406.3374 [math.NT], 2014
EXAMPLE
Triangle begins:
0;
0, 0;
0, 1, 0;
0, 1, 2, 0, 0;
0, 1, 2, 1, 3, 1, 0;
0, 1, 2, 1, 3, 2, 4, 0, 2, 0, 0;
0, 1, 2, 1, 3, 2, 4, 1, 3, 2, 5, 1, 3, 1, 0;
0, 1, 2, 1, 3, 2, 4, 1, 3, 2, 5, 2, 4, 3, 6, 0, 2, 1, 4, 2, 0, 0;
...
For n = 6 we have:
--------------------------------------------------------
. Largest Smallest Difference
k Partition of 6 part part T(6,k)
--------------------------------------------------------
1: [1, 1, 1, 1, 1, 1] 1 - 1 = 0
2: [2, 1, 1, 1, 1] 2 - 1 = 1
3: [3, 1, 1, 1] 3 - 1 = 2
4: [2, 2, 1, 1] 2 - 1 = 1
5: [4, 1, 1] 4 - 1 = 3
6: [3, 2, 1] 3 - 1 = 2
7: [5, 1] 5 - 1 = 4
8: [2, 2, 2] 2 - 2 = 0
9: [4, 2] 4 - 2 = 2
10: [3, 3] 3 - 3 = 0
11: [6] 6 - 6 = 0
--------------------------------------------------------
So the 6th row of triangle is [0,1,2,1,3,2,4,0,2,0,0] and the row sum is A116686(6) = 15.
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Omar E. Pol, Jul 18 2014
STATUS
approved