Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
For n <= 22, the number of all Lyndon words is equal to the number of Lyndon words in BCH exactly if n is prime. Namely the exceptions 9, 15, 21 are the ood numbers which are not prime. I observed something similar in my own research in a different context (full support in prime degrees).
