A triangular recursion sequence: A(n,k,m)= (m* n - m*k + 1)*A(n - 1, k - 1, m) + (m*k - (m - 1))*A(n - 1, k, m); t(n,k)=2*A(n, k, 1)*A(n + 1, k + 1, 0)/(n - k + 1) - A(n, k, 0)*A(n, k, 1).

A156534

A triangular recursion sequence: A(n,k,m)= (m* n - m*k + 1)*A(n - 1, k - 1, m) + (m*k - (m - 1))*A(n - 1, k, m); t(n,k)=2*A(n, k, 1)*A(n + 1, k + 1, 0)/(n - k + 1) - A(n, k, 0)*A(n, k, 1).

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =4a(5) =1a(6) =1a(7) =11a(8) =11a(9) =1a(10) =1a(11) =26a(12) =44a(13) =26a(14) =1a(15) =1a(16) =57a(17) =0a(18) =0a(19) =57a(20) =1a(21) =1a(22) =120a(23) =-1191a(24) =-6040a(25) =-1191a(26) =120a(27) =1a(28) =1a(29) =247

External references