Table T(n,k) read by antidiagonals. T(n,k) is the number of primitive (=aperiodic) k-ary Lyndon words (n,k >= 1) with length less than or equal to n.
A143328
Table T(n,k) read by antidiagonals. T(n,k) is the number of primitive (=aperiodic) k-ary Lyndon words (n,k >= 1) with length less than or equal to n.
Terms
- a(0) =1a(1) =2a(2) =1a(3) =3a(4) =3a(5) =1a(6) =4a(7) =6a(8) =5a(9) =1a(10) =5a(11) =10a(12) =14a(13) =8a(14) =1a(15) =6a(16) =15a(17) =30a(18) =32a(19) =14a(20) =1a(21) =7a(22) =21a(23) =55a(24) =90a(25) =80a(26) =23a(27) =1a(28) =8a(29) =28
External references
- oeis: A143328