OFFSET
0,2
COMMENTS
Triangle T(n,k), 0 <= k <= n, read by rows given by [2, 2, 8, 12, 32, 56, 128, 240, 512, ...] DELTA [[1, 0, 2, 0, 4, 0, 8, 0, 16, 0, 32, 0, ...] = A014236 (first zero omitted) DELTA A077957 where DELTA is the operator defined in A084938. - Philippe Deléham, Aug 23 2006
LINKS
G. C. Greubel, Rows n = 0..50 of the triangle, flattened
FORMULA
Sum_{k=0..n} T(n, k) = A028362(n).
T(n,0) = 2^(n*(n+1)/2) = A006125(n+1). - Philippe Deléham, Nov 05 2006
T(n,k) = 2^binomial(n+1-k,2) * A022166(n,k) for 0 <= k <= n. - Werner Schulte, Mar 25 2019
EXAMPLE
Triangle begins:
1;
2, 1;
8, 6, 1;
64, 56, 14, 1;
1024, 960, 280, 30, 1;
32768, 31744, 9920, 1240, 62, 1;
MATHEMATICA
T[n_, k_, q_]:= T[n, k, q]= If[k<0 || k>n, 0, If[k==n, 1, q^n*T[n-1, k, q] +T[n-1, k-1, q] ]];
Table[T[n, k, 2], {n, 0, 10}, {k, 0, n}]//Flatten (* G. C. Greubel, Feb 20 2021 *)
PROG
(Sage)
def T(n, k, q):
if (k<0 or k>n): return 0
elif (k==n): return 1
else: return q^n*T(n-1, k, q) + T(n-1, k-1, q)
flatten([[T(n, k, 2) for k in (0..n)] for n in (0..10)]) # G. C. Greubel, Feb 20 2021
(Magma)
function T(n, k, q)
if k lt 0 or k gt n then return 0;
elif k eq n then return 1;
else return q^n*T(n-1, k, q) + T(n-1, k-1, q);
end if; return T; end function;
[T(n, k, 2): k in [0..n], n in [0..10]]; // G. C. Greubel, Feb 20 2021
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Gerald McGarvey, Jun 05 2005
STATUS
approved