T(n,k)=Number of length n+k+2 0..k arrays with every value 0..k appearing at least once in every consecutive k+3 elements, and new values 0..k introduced in order.
A242322
T(n,k)=Number of length n+k+2 0..k arrays with every value 0..k appearing at least once in every consecutive k+3 elements, and new values 0..k introduced in order.
Terms
- a(0) =7a(1) =25a(2) =13a(3) =65a(4) =61a(5) =24a(6) =140a(7) =185a(8) =145a(9) =44a(10) =266a(11) =440a(12) =503a(13) =337a(14) =81a(15) =462a(16) =896a(17) =1300a(18) =1316a(19) =781a(20) =149a(21) =750a(22) =1638a(23) =2801a(24) =3648a(25) =3398a(26) =1829a(27) =274a(28) =1155a(29) =2766
External references
- oeis: A242322