login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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

%I

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

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

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

%H Jakub Kowalski and Marek Szykuła, <a href="http://arxiv.org/pdf/1301.2092.pdf">The Černý conjecture for small automata: experimental report</a>, arxiv preprint, January 2013.

%H James Mitchell, <a href="http://www-groups.mcs.st-andrews.ac.uk/~jamesm/data.php">Semigroups data</a> (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).

%K nonn,more

%O 2,1

%A _James Mitchell_, Jul 29 2014

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 21 23:21 EST 2020. Contains 332113 sequences. (Running on oeis4.)