Table T(n,k) by antidiagonals. T(n,k) is the number of primitive (=aperiodic) k-ary words (n,k >= 1) with length less than or equal to n which are earlier in lexicographic order than any other word derived by cyclic shifts of the alphabet.

A143327

Table T(n,k) by antidiagonals. T(n,k) is the number of primitive (=aperiodic) k-ary words (n,k >= 1) with length less than or equal to n which are earlier in lexicographic order than any other word derived by cyclic shifts of the alphabet.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =1a(6) =1a(7) =3a(8) =5a(9) =1a(10) =1a(11) =4a(12) =11a(13) =11a(14) =1a(15) =1a(16) =5a(17) =19a(18) =35a(19) =26a(20) =1a(21) =1a(22) =6a(23) =29a(24) =79a(25) =115a(26) =53a(27) =1a(28) =1a(29) =7

External references