A230326 Number of nonisomorphic strongly connected binary n-state automata without output under input permutations.

1, 4, 29, 460, 10701, 329794, 12310961, 538586627, 26959384899, 1518185815760

Offset

1,2

References

A. Kisielewicz and M. Szykuła. Generating Small Automata and the Černý Conjecture. In Implementation and Application of Automata, volume 7982 of LNCS, pages 340-348, 2013.

Links

Table of n, a(n) for n=1..10.

Example

For n=2 there are 4 such automata: [0 a 1,0 b 1,1 a 0,1 b 0], [0 a 0,0 b 1,1 a 0,1 b 0], [0 a 0,0 b 1,1 a 1,1 b 0] and [0 a 0,0 b 1,1 a 0,1 b 1].

Crossrefs

Cf. A054745, A054746, A027835.

Sequence in context: A324227 A277357 A173715 * A272869 A166168 A126559

Adjacent sequences: A230323 A230324 A230325 * A230327 A230328 A230329

Keyword

nonn,hard,more

Author

Marek Szykula, Oct 16 2013

Status

approved