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.
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.
Terms
- a(0) =4a(1) =16a(2) =140a(3) =13212
External references
- oeis: A375919