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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A230326 Number of nonisomorphic strongly connected binary n-state automata without output under input permutations. 1
1, 4, 29, 460, 10701, 329794, 12310961, 538586627, 26959384899, 1518185815760 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

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 1,0 b 1,1 a 0,1 b 0], [0 a 0,0 b 1,1 a 0,1 b 0], [0 a 0,0 b 1,1 a 1,1 b 0] and [0 a 0,0 b 1,1 a 0,1 b 1].

CROSSREFS

Cf. A054745, A054746, A027835.

Sequence in context: A162287 A277357 A173715 * A272869 A166168 A126559

Adjacent sequences:  A230323 A230324 A230325 * A230327 A230328 A230329

KEYWORD

nonn,hard,more

AUTHOR

Marek Szykula, Oct 16 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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified September 22 00:25 EDT 2017. Contains 292326 sequences.