Riordan's general Eulerian recursion: T(n, k) = (k+2)*T(n-1, k) + (n-k-1) * T(n-1, k-1) with T(n,1) = 1, T(n,n) = (-1)^(n-1).

A157013

Riordan's general Eulerian recursion: T(n, k) = (k+2)*T(n-1, k) + (n-k-1) * T(n-1, k-1) with T(n,1) = 1, T(n,n) = (-1)^(n-1).

Terms

    a(0) =1a(1) =1a(2) =-1a(3) =1a(4) =-4a(5) =1a(6) =1a(7) =-15a(8) =5a(9) =-1a(10) =1a(11) =-58a(12) =10a(13) =-6a(14) =1a(15) =1a(16) =-229a(17) =-66a(18) =-26a(19) =7a(20) =-1a(21) =1a(22) =-912a(23) =-1017a(24) =-288a(25) =23a(26) =-8a(27) =1a(28) =1a(29) =-3643

External references