2162960

Appears in sequences

• Maximal number of states in the minimal deterministic finite automaton accepting a language over a binary alphabet consisting of some words of length n.at n=25A000802