Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006692
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006692 Number of connected n-state finite automata with 3 inputs.
(Formerly M5298)
+0
1
49, 6877, 1854545, 807478656, 514798204147, 451182323794896, 519961864703259753, 762210147961330421167, 1384945048774500147047194 (list; graph; listen)
OFFSET

1,1

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Robert W. Robinson, Counting strongly connected finite automata, pp. 671-685 of Y. Alavi et al., eds., Graph Theory, Combinatorics and Applications. Wiley, NY, 2 vols., 1991.

CROSSREFS

Sequence in context: A075416 A127861 A130416 this_sequence A014801 A094199 A145251

Adjacent sequences: A006689 A006690 A006691 this_sequence A006693 A006694 A006695

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research