327952domain: NAppears in sequencesMaximal 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=22A000802