login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A245686 Number of nonisomorphic synchronizing strongly connected binary n-state automata without output under input permutations. 0
2, 21, 395, 10180, 322095, 12194323, 536197356, 26904958363, 1516697994964 (list; graph; refs; listen; history; text; internal format)
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 A087546 A090729

Adjacent sequences:  A245683 A245684 A245685 * A245687 A245688 A245689

KEYWORD

nonn,more

AUTHOR

James Mitchell, Jul 29 2014

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified September 22 09:45 EDT 2017. Contains 292337 sequences.