|
|
A247642
|
|
Triangle read by rows: T(n,2k+1) = T(n-1,2k-1)+T(n-1,2k), T(n,2k) = T(n-1,2k-2)+2T(n-1,2k-1)+T(n-1,2k).
|
|
1
|
|
|
1, 1, 1, 1, 1, 1, 4, 2, 1, 1, 1, 7, 5, 9, 3, 1, 1, 1, 10, 8, 26, 14, 16, 4, 1, 1, 1, 13, 11, 52, 34, 70, 30, 25, 5, 1, 1, 1, 16, 14, 87, 63, 190, 104, 155, 55, 36, 6, 1, 1, 1, 19, 17, 131, 101, 403, 253, 553, 259, 301, 91, 49, 7, 1, 1, 1, 22, 20, 184
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,7
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
1
1 1 1
1 1 4 2 1
1 1 7 5 9 3 1
1 1 10 8 26 14 16 4 1
1 1 13 11 52 34 70 30 25 5 1
...
|
|
MAPLE
|
option remember;
if k < 0 or k > 2*n then
return 0;
elif k = 0 then
return 1 ;
end if;
if type(k, 'odd') then
procname(n-1, k-2)+procname(n-1, k-1) ;
else
procname(n-1, k-2)+2*procname(n-1, k-1)+procname(n-1, k) ;
end if;
|
|
MATHEMATICA
|
T[_, 0] = 1; T[n_, k_] /; 0 <= k <= 2n := T[n, k] = If[OddQ[k], T[n-1, k-2] + T[n-1, k-1], T[n-1, k-2] + 2*T[n-1, k-1] + T[n-1, k]]; T[_, _] = 0;
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|