T(n,k)=Number of length n+k 0..2 arrays with at most one downstep in every k consecutive neighbor pairs.

A255107

T(n,k)=Number of length n+k 0..2 arrays with at most one downstep in every k consecutive neighbor pairs.

Terms

    a(0) =9a(1) =26a(2) =27a(3) =66a(4) =75a(5) =81a(6) =147a(7) =168a(8) =216a(9) =243a(10) =294a(11) =331a(12) =441a(13) =622a(14) =729a(15) =540a(16) =597a(17) =789a(18) =1137a(19) =1791a(20) =2187a(21) =927a(22) =1008a(23) =1302a(24) =1905a(25) =2907a(26) =5157a(27) =6561a(28) =1507a(29) =1616

External references