|
|
A159797
|
|
Triangle read by rows in which row n lists n+1 terms, starting with n, such that the difference between successive terms is equal to n-1.
|
|
33
|
|
|
0, 1, 1, 2, 3, 4, 3, 5, 7, 9, 4, 7, 10, 13, 16, 5, 9, 13, 17, 21, 25, 6, 11, 16, 21, 26, 31, 36, 7, 13, 19, 25, 31, 37, 43, 49, 8, 15, 22, 29, 36, 43, 50, 57, 64, 9, 17, 25, 33, 41, 49, 57, 65, 73, 81, 10, 19, 28, 37, 46, 55, 64, 73, 82, 91, 100, 11, 21, 31, 41, 51, 61, 71, 81, 91, 101
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
Note that the last term of the n-th row is the n-th square A000290(n).
T(n,k) is the number of distinct sums in the direct sum of {1, 2, ... n} with itself k times for 1 <= k <= n+1, e.g., T(5,3) = the number of distinct sums in the direct sum {1,2,3,4,5} + {1,2,3,4,5} + {1,2,3,4,5}. The sums range from 1+1+1=3 to 5+5+5=15. So there are 13 distinct sums. - Derek Orr, Nov 26 2014
|
|
LINKS
|
|
|
FORMULA
|
Given m = floor( (sqrt(8*n+1)-1)/2 ), then a(n) = m + (n - m*(m+1)/2)*(m-1). - Carl R. White, Jul 24 2010
|
|
EXAMPLE
|
Triangle begins:
0;
1, 1;
2, 3, 4;
3, 5, 7, 9;
4, 7,10,13,16;
5, 9,13,17,21,25;
6,11,16,21,26,31,36;
|
|
MAPLE
|
|
|
MATHEMATICA
|
Flatten[Table[NestList[#+n-1&, n, n], {n, 0, 12}]] (* Harvey P. Dale, Aug 04 2014 *)
|
|
PROG
|
(GNU bc) scale=0; for(n=0; n<76; n++){m=(sqrt(8*n+1)-1)/2; print m+(n-m*(m+1)/2)*(m-1), ", "}; print"\n" /* Carl R. White, Jul 24 2010 */
|
|
CROSSREFS
|
Triangle sums (see the comments): A006002 (Row1), A050187 (Row2), A058187 (Related to Kn11, Kn12, Kn13, Fi1 and Ze1), A006918 (Related to Kn21, Kn22, Kn23, Fi2 and Ze2), A000330 (Kn3), A016061 (Kn4), A190717 (Related to Ca1 and Ze3), A144677 (Related to Ca2 and Ze4), A000292 (Related to Ca3, Ca4, Gi3 and Gi4) A190718 (Related to Gi1) and A144678 (Related to Gi2). (End)
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|