Triangle, read by rows, defined by recurrence: T(n,k) = T(n-1,k-1) + (-1)^k * (2 * k + 1) * T(n-1,k) for 0 < k < n with initial values T(n,0) = T(n,n) = 1 for n >= 0 and T(i,j) = 0 if j < 0 or j > i.
A346083
Triangle, read by rows, defined by recurrence: T(n,k) = T(n-1,k-1) + (-1)^k * (2 * k + 1) * T(n-1,k) for 0 < k < n with initial values T(n,0) = T(n,n) = 1 for n >= 0 and T(i,j) = 0 if j < 0 or j > i.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =-2a(5) =1a(6) =1a(7) =7a(8) =3a(9) =1a(10) =1a(11) =-20a(12) =22a(13) =-4a(14) =1a(15) =1a(16) =61a(17) =90a(18) =50a(19) =5a(20) =1a(21) =1a(22) =-182a(23) =511a(24) =-260a(25) =95a(26) =-6a(27) =1a(28) =1a(29) =547
External references
- oeis: A346083