Triangle T(n,k), 0 <= k <= n, read by rows, defined by: T(0,0) = 1, T(n,k) = 0 if n<k, T(n,0) = T(n-1,0) + T(n-1,1) and for k >= 1: T(n,k) = T(n-1,k-1) + x*T(n-1,k) + T(n-1,k+1) with x = 3.

A110877

Triangle T(n,k), 0 <= k <= n, read by rows, defined by: T(0,0) = 1, T(n,k) = 0 if n<k, T(n,0) = T(n-1,0) + T(n-1,1) and for k >= 1: T(n,k) = T(n-1,k-1) + x*T(n-1,k) + T(n-1,k+1) with x = 3.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =4a(5) =1a(6) =6a(7) =15a(8) =7a(9) =1a(10) =21a(11) =58a(12) =37a(13) =10a(14) =1a(15) =79a(16) =232a(17) =179a(18) =68a(19) =13a(20) =1a(21) =311a(22) =954a(23) =837a(24) =396a(25) =108a(26) =16a(27) =1a(28) =1265a(29) =4010

External references