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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A027834 Number of labeled strongly connected n-state 2-input automata. 1
1, 9, 296, 20958, 2554344, 474099840 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

REFERENCES

V. A. Liskovets [ Liskovec ], Enumeration of nonisomorphic strongly connected automata. (Russian); Vesti Akad. Nauk. Belarus. SSR, Ser. Phys.-Mat., No. 3, 1971, pp. 26-30, esp. p. 30 (Math. Rev. 46 #5081).

V. A. Liskovets [ Liskovec ], A general enumeration scheme for labeled graphs. (Russian); Dokl. Akad. Nauk. Belarus. SSR, Vol. 21, No. 6 (1977), pp. 496-499 (Math. Rev. 58 #21797).

Zentralblatt 224.94053, 412.05052.

CROSSREFS

Sequence in context: A055792 A053935 A086699 * A175823 A129934 A003303

Adjacent sequences:  A027831 A027832 A027833 * A027835 A027836 A027837

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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

Content is available under The OEIS End-User License Agreement .

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.