The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A230401 Number of nonisomorphic synchronizing binary n-state automata without output under input permutations. 0
 1, 4, 51, 1115, 34265, 1318699, 60477844, 3210707626, 193589241468, 13070085476528 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS An automaton with the state set Q is synchronizing if there exists a word w such that |Qw|=1. 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 0,0 b 1,1 a 0,1 b 0], [0 a 0,0 b 0,1 a 0,1 b 0], [0 a 0,0 b 1,1 a 0,1 b 1], and [0 a 0,0 b 0,1 a 1,1 b 0]. CROSSREFS Cf. A054745, A054746, A230326. Sequence in context: A336608 A349653 A235325 * A293075 A300732 A220282 Adjacent sequences: A230398 A230399 A230400 * A230402 A230403 A230404 KEYWORD nonn,hard,more AUTHOR Marek Szykula, Oct 18 2013 STATUS approved

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

Last modified June 9 11:22 EDT 2023. Contains 363178 sequences. (Running on oeis4.)