OFFSET
0,5
LINKS
G. C. Greubel, Rows n = 0..50 of the triangle, flattened
FORMULA
T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m*k + 1)*T(n-1, k, m) + m*f(n,k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1, f(n, k) = k if k <= floor(n/2) otherwise n-k, and m = 2.
T(n, n-k, m) = T(n, k, m).
EXAMPLE
Triangle begins as:
1;
1, 1;
1, 8, 1;
1, 31, 31, 1;
1, 102, 342, 102, 1;
1, 317, 2548, 2548, 317, 1;
1, 964, 16001, 37724, 16001, 964, 1;
1, 2907, 91877, 423365, 423365, 91877, 2907, 1;
1, 8738, 501032, 4070208, 7922362, 4070208, 501032, 8738, 1;
MATHEMATICA
f[n_, k_]:= If[k<=Floor[n/2], k, n-k];
T[n_, k_, m_]:= T[n, k, m]= If[k==0 || k==n, 1, (m*(n-k)+1)*T[n-1, k-1, m] + (m*k+1)*T[n-1, k, m] + m*f[n, k]*T[n-2, k-1, m]];
Table[T[n, k, 2], {n, 0, 10}, {k, 0, n}]//Flatten (* modified by G. C. Greubel, Jan 10 2022 *)
PROG
(Sage)
def f(n, k): return k if (k <= n//2) else n-k
@CachedFunction
def T(n, k, m): # A157208
if (k==0 or k==n): return 1
else: return (m*(n-k) +1)*T(n-1, k-1, m) + (m*k+1)*T(n-1, k, m) + m*f(n, k)*T(n-2, k-1, m)
flatten([[T(n, k, 2) for k in (0..n)] for n in (0..20)]) # G. C. Greubel, Jan 10 2022
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Roger L. Bagula, Feb 25 2009
EXTENSIONS
Edited by G. C. Greubel, Jan 10 2022
STATUS
approved