proposed
approved
proposed
approved
editing
proposed
T:= proc(n, k) option remember;
if k < 0 or k > n then return 0 fi;
procname (n-1, k-1)-3*procname(n-1, k)+2*procname(n-2, k-1)-3*procname(n-2, k)+
procname(n-3, k-1)-procname(n-3, k)
end proc:
T(0, 0):= 1: T(1, 1):= 1: T(2, 2):= 1:
T(1, 0):= 0: T(2, 0):= -1: T(2, 1):= -1:
seq(seq(T(n, k), k=0..n), n=0..12); # Robert Israel, Jul 16 2019
proposed
editing
editing
proposed
Robert Israel, <a href="/A097808/b097808.txt">Table of n, a(n) for n = 0..10010</a> (rows 0 to 140, flattened)
approved
editing
proposed
approved
editing
proposed
1, 0, 1, -1, -1, 1, 2, 0, -2, 1, -3, 2, 2, -3, 1, 4, -5, 0, 5, -4, 1, -5, 9, -5, -5, 9, -5, 1, 6, -14, 14, 0, -14, 14, -6, 1, -7, 20, -28, 14, 14, -28, 20, -7, 1, 8, -27, 48, -42, 0, 42, -48, 27, -8, 1, -9, 35, -75, 90, -42, -42, 90, -75, 35, -9, 1, 10, -44, 110, -165, 132, 0, -132, 165, -110, 44, -10, 1
(* The function RiordanArray is defined in A256893. *)
RiordanArray[(1 + 2 #)/(1 + #)^2&, #/(1 + #)&, 12] // Flatten (* Jean-François Alcover, Jul 16 2019 *)
approved
editing
proposed
approved
editing
proposed