|
| |
|
|
A104792
|
|
Triangle T(n,k) = A000330(n-k), n>=1, 0<=k<n, read by rows.
|
|
0
| |
|
|
1, 5, 1, 14, 5, 1, 30, 14, 5, 1, 55, 30, 14, 5, 1, 91, 55, 30, 14, 5, 1, 140, 91, 55, 30, 14, 5, 1, 204, 140, 91, 55, 30, 14, 5, 1, 285, 204, 140, 91, 55, 30, 14, 5, 1, 385, 285, 204, 140, 91, 55, 30, 14, 5, 1, 506, 385, 285, 204, 140, 91, 55, 30, 14, 5, 1, 650, 506, 385, 285
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Repeatedly writing the square pyramidal numbers (A000330) backwards.
|
|
|
FORMULA
| T(n,k) = (n-k)(n-k+1)(2n-2k+1)/6 = A000330(A004736(n)). -- R. Stephan, Apr 05 2009
|
|
|
EXAMPLE
| First few rows of the triangle are:
1;
5, 1;
14, 5, 1;
30, 14, 5, 1;
55, 30, 14, 5, 1;
91, 55, 30, 14, 5, 1;
...
|
|
|
CROSSREFS
| Row sums are in A002415. Antidiagonals are in A000332.
Sequence in context: A146620 A174504 A067558 * A120393 A094368 A087727
Adjacent sequences: A104789 A104790 A104791 * A104793 A104794 A104795
|
|
|
KEYWORD
| nonn,easy,tabl
|
|
|
AUTHOR
| Gary W. Adamson (qntmpkt(AT)yahoo.com), Mar 26 2005
|
|
|
EXTENSIONS
| Edited by Ralf Stephan, Apr 05 2009
|
| |
|
|
