T(n,k)=Number of length n arrays x(i), i=1..n with x(i) in i..i+k and no value appearing more than 3 times.

A250361

T(n,k)=Number of length n arrays x(i), i=1..n with x(i) in i..i+k and no value appearing more than 3 times.

Terms

    a(0) =2a(1) =3a(2) =4a(3) =4a(4) =9a(5) =8a(6) =5a(7) =16a(8) =27a(9) =16a(10) =6a(11) =25a(12) =64a(13) =81a(14) =32a(15) =7a(16) =36a(17) =125a(18) =255a(19) =243a(20) =64a(21) =8a(22) =49a(23) =216a(24) =623a(25) =1016a(26) =729a(27) =128a(28) =9a(29) =64

External references