A006691 - OEIS

This site is supported by donations to The OEIS Foundation.

A006691

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

9, 148, 3493, 106431, 3950832, 172325014, 8617033285, 485267003023, 30363691715629, 2088698040637242, 156612539215405732, 12709745319947141220 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	REFERENCES	`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.` `N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).`
	CROSSREFS	`Sequence in context: A064091 A132060 A178185 * A050580 A183439 A027018` `Adjacent sequences: A006688 A006689 A006690 * A006692 A006693 A006694`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

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

Last modified February 15 15:20 EST 2012. Contains 205823 sequences.