T(n,k)=Number of length n+k 0..3 arrays with at most two downsteps in every k consecutive neighbor pairs.

A255660

T(n,k)=Number of length n+k 0..3 arrays with at most two downsteps in every k consecutive neighbor pairs.

Terms

    a(0) =16a(1) =64a(2) =64a(3) =255a(4) =256a(5) =256a(6) =968a(7) =1016a(8) =1024a(9) =1024a(10) =3340a(11) =3692a(12) =4048a(13) =4096a(14) =4096a(15) =10320a(16) =11752a(17) =14192a(18) =16128a(19) =16384a(20) =16384a(21) =28722a(22) =33042a(23) =42653a(24) =54560a(25) =64257a(26) =65536a(27) =65536a(28) =72920a(29) =83752

External references