T(n,k)=Number of length n+k 0..3 arrays with at most one downstep in every k consecutive neighbor pairs.
A258730
T(n,k)=Number of length n+k 0..3 arrays with at most one downstep in every k consecutive neighbor pairs.
Terms
- a(0) =16a(1) =60a(2) =64a(3) =190a(4) =225a(5) =256a(6) =512a(7) =608a(8) =840a(9) =1024a(10) =1212a(11) =1408a(12) =2028a(13) =3136a(14) =4096a(15) =2592a(16) =2936a(17) =4184a(18) =6552a(19) =11704a(20) =16384a(21) =5115a(22) =5664a(23) =7834a(24) =12549a(25) =20955a(26) =43681a(27) =65536a(28) =9460a(29) =10280
External references
- oeis: A258730