Number of minimal deterministic finite automata (DFA) with n states on a two-letter alphabet.

A129622

Number of minimal deterministic finite automata (DFA) with n states on a two-letter alphabet.

Terms

    a(0) =0a(1) =2a(2) =24a(3) =1028a(4) =56014a(5) =3705306a(6) =286717796a(7) =25493886852

External references