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 1 time.

A248944

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 1 time.

Terms

    a(0) =2a(1) =3a(2) =3a(3) =4a(4) =7a(5) =4a(6) =5a(7) =13a(8) =14a(9) =5a(10) =6a(11) =21a(12) =36a(13) =26a(14) =6a(15) =7a(16) =31a(17) =76a(18) =90a(19) =46a(20) =7a(21) =8a(22) =43a(23) =140a(24) =246a(25) =212a(26) =79a(27) =8a(28) =9a(29) =57

External references