Triangle read by rows, defined by Riordan's general Eulerian recursion: T(n, k) = (k+3)*T(n-1, k) + (n-k-2) * T(n-1, k-1) with T(n,1) = 1, T(n,n) = (-2)^(n-1).
A306547
Triangle read by rows, defined by Riordan's general Eulerian recursion: T(n, k) = (k+3)*T(n-1, k) + (n-k-2) * T(n-1, k-1) with T(n,1) = 1, T(n,n) = (-2)^(n-1).
Terms
- a(0) =1a(1) =1a(2) =-2a(3) =1a(4) =-11a(5) =4a(6) =1a(7) =-55a(8) =35a(9) =-8a(10) =1a(11) =-274a(12) =210a(13) =-91a(14) =16a(15) =1a(16) =-1368a(17) =986a(18) =-637a(19) =219a(20) =-32a(21) =1a(22) =-6837a(23) =3180a(24) =-3473a(25) =1752a(26) =-507a(27) =64a(28) =1a(29) =-34181
External references
- oeis: A306547