id:A006691 - OEIS Search Results

Search: id:A006691

Displaying 1-1 of 1 results found.

page 1

Number of connected n-state finite automata with 2 inputs.
(Formerly M4662)

+0
1

9, 148, 3493, 106431, 3950832, 172325014, 8617033285, 485267003023, 30363691715629, 2088698040637242, 156612539215405732, 12709745319947141220 (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: A046529 A064091 A132060 this_sequence A050580 A027018 A089916` `Adjacent sequences: A006688 A006689 A006690 this_sequence A006692 A006693 A006694`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research