|
|
A194122
|
|
Triangular array: T(n,k) = C(n+4,k) + C(n+4,k+1) + C(n+4,k+2) + C(n+4,k+3) + C(n+4,k+4), 0 <= k <= n.
|
|
2
|
|
|
16, 31, 31, 57, 62, 57, 99, 119, 119, 99, 163, 218, 238, 218, 163, 256, 381, 456, 456, 381, 256, 386, 637, 837, 912, 837, 637, 386, 562, 1023, 1474, 1749, 1749, 1474, 1023, 562, 794, 1585, 2497, 3223, 3498, 3223, 2497, 1585, 794, 1093, 2379, 4082
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
16;
31, 31;
57, 62, 57;
99, 119, 119, 99;
163, 218, 238, 218, 163;
|
|
MAPLE
|
|
|
MATHEMATICA
|
T[n_, k_] := Sum[Binomial[n + 4, k + j], {j, 0, 4}]
Flatten[Table[T[n, k], {n, 0, 10}, {k, 0, n}]]
(* as a sequence *)
TableForm[Table[T[n, k], {n, 0, 10}, {k, 0, n}]]
(* as an array *)
|
|
PROG
|
(GAP) Flat(List([0..9], n->List([0..n], k->Sum([0..4], j->Binomial(n+4, k+j))))); # Muniru A Asiru, Mar 17 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|