T(n,k) = number of length-n 0..k arrays with no adjacent pair x,x+1 repeated: infinite square array read by falling antidiagonals.

A269656

T(n,k) = number of length-n 0..k arrays with no adjacent pair x,x+1 repeated: infinite square array read by falling antidiagonals.

Terms

    a(0) =2a(1) =3a(2) =4a(3) =4a(4) =9a(5) =8a(6) =5a(7) =16a(8) =27a(9) =15a(10) =6a(11) =25a(12) =64a(13) =79a(14) =26a(15) =7a(16) =36a(17) =125a(18) =253a(19) =225a(20) =42a(21) =8a(22) =49a(23) =216a(24) =621a(25) =988a(26) =626a(27) =64a(28) =9a(29) =64

External references