Number of words A(n,k), either empty or beginning with the first letter of the cyclic k-ary alphabet, where each letter of the alphabet occurs n times and letters of neighboring word positions are equal or neighbors in the alphabet; square array A(n,k), n>=0, k>=0, read by antidiagonals.
A208879
Number of words A(n,k), either empty or beginning with the first letter of the cyclic k-ary alphabet, where each letter of the alphabet occurs n times and letters of neighboring word positions are equal or neighbors in the alphabet; square array A(n,k), n>=0, k>=0, read by antidiagonals.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =1a(6) =1a(7) =1a(8) =1a(9) =1a(10) =1a(11) =2a(12) =3a(13) =1a(14) =1a(15) =1a(16) =2a(17) =30a(18) =10a(19) =1a(20) =1a(21) =1a(22) =2a(23) =62a(24) =560a(25) =35a(26) =1a(27) =1a(28) =1a(29) =2
External references
- oeis: A208879