login
A375919
Number of states in minimal deterministic finite automaton recognizing the language of binary strings that contain, as contiguous blocks, all binary strings of length n.
0
4, 16, 140, 13212
OFFSET
1,1
COMMENTS
The shortest words accepted by these automata are exactly the de Bruijn words of level n.
CROSSREFS
Sequence in context: A195899 A362143 A358289 * A156482 A335832 A173346
KEYWORD
nonn,more
AUTHOR
Jeffrey Shallit, Sep 02 2024
STATUS
approved