Riordan's general Eulerian recursion: T(n,k) = (k+2)*T(n-1, k) + (n-k) * T(n-1, k-1), with T(n,0) = 1, T(n,n) = 0.
A157012
Riordan's general Eulerian recursion: T(n,k) = (k+2)*T(n-1, k) + (n-k) * T(n-1, k-1), with T(n,0) = 1, T(n,n) = 0.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =1a(4) =1a(5) =0a(6) =1a(7) =5a(8) =1a(9) =0a(10) =1a(11) =18a(12) =14a(13) =1a(14) =0a(15) =1a(16) =58a(17) =110a(18) =33a(19) =1a(20) =0a(21) =1a(22) =179a(23) =672a(24) =495a(25) =72a(26) =1a(27) =0a(28) =1a(29) =543
External references
- oeis: A157012