%I
%S 2,21,395,10180,322095,12194323,536197356,26904958363,1516697994964
%N Number of nonisomorphic synchronizing strongly connected binary nstate automata without output under input permutations.
%C Number of 2sets 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://wwwgroups.mcs.standrews.ac.uk/~jamesm/data.php">Semigroups data</a> (contains links to files containing the 2element 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
