Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A027834
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A027834 Number of labeled strongly connected n-state 2-input automata. +0
2
1, 9, 296, 20958, 2554344, 474099840 (list; graph; listen)
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 this_sequence A129934 A003303 A012838

Adjacent sequences: A027831 A027832 A027833 this_sequence A027835 A027836 A027837

KEYWORD

nonn

AUTHOR

njas

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research