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

2, 21, 395, 10180, 322095, 12194323, 536197356, 26904958363, 1516697994964

Offset

2,1

Comments

Number of 2-sets of transformations, up to conjugation, generating a transitive semigroup on n points that contains a constant transformation.

Links

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

Jakub Kowalski and Marek Szykuła, The Černý conjecture for small automata: experimental report, arxiv preprint, January 2013.

James Mitchell, Semigroups data (contains links to files containing the 2-element sets of transformations on n points (up to conjugation) which generate a transitive semigroup containing a constant transformation).

Crossrefs

Sequence in context: A228384 A216281 A263625 * A091315 A359716 A087546

Adjacent sequences: A245683 A245684 A245685 * A245687 A245688 A245689

Keyword

nonn,more

Author

James Mitchell, Jul 29 2014

Status

approved