Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A027835
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A027835 Number of unlabeled strongly connected n-state 2-input automata. +0
1
1, 6, 52, 892, 21291, 658885 (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.

CROSSREFS

Sequence in context: A144345 A097820 A164894 this_sequence A055973 A066357 A109092

Adjacent sequences: A027832 A027833 A027834 this_sequence A027836 A027837 A027838

KEYWORD

nonn

AUTHOR

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

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 December 17 13:29 EST 2009. Contains 170826 sequences.


AT&T Labs Research