Random triples
| Subject | Object |
|---|---|
| gptkb:Lyndon_words | The number of Lyndon words of length n over an alphabet of k symbols is (1/n) times the sum over all divisors d of n of μ(d)k^{n/d}, where μ is the Möbius function. |
| Subject | Object |
|---|---|
| gptkb:Lyndon_words | The number of Lyndon words of length n over an alphabet of k symbols is (1/n) times the sum over all divisors d of n of μ(d)k^{n/d}, where μ is the Möbius function. |