Table T(n,k) read by downward antidiagonals: number of Lyndon words (aperiodic necklaces) with n beads of k colors, n >= 1, k >= 1.
A074650
Table T(n,k) read by downward antidiagonals: number of Lyndon words (aperiodic necklaces) with n beads of k colors, n >= 1, k >= 1.
Terms
- a(0) =1a(1) =2a(2) =0a(3) =3a(4) =1a(5) =0a(6) =4a(7) =3a(8) =2a(9) =0a(10) =5a(11) =6a(12) =8a(13) =3a(14) =0a(15) =6a(16) =10a(17) =20a(18) =18a(19) =6a(20) =0a(21) =7a(22) =15a(23) =40a(24) =60a(25) =48a(26) =9a(27) =0a(28) =8a(29) =21
External references
- oeis: A074650