id:A068932 - OEIS Search Results

Search: id:A068932

Displaying 1-1 of 1 results found.

page 1

a(n) = number of disconnected regular graphs with n nodes.

+0
5

0, 1, 1, 2, 1, 3, 2, 5, 4, 9, 7, 23, 18, 74, 106, 619, 2076, 22526, 112834, 4799825, 31138965, 4207943011, 115979718015 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`A graph is called regular if every node has the same number of edges.` `Row sums of A068933.`
	FORMULA	`a(n) = A005176(n) - A005177(n).`
	CROSSREFS	`Cf. A005176, A005177, A068933.` `Sequence in context: A005916 A034392 A034393 this_sequence A151533 A128100 A035579` `Adjacent sequences: A068929 A068930 A068931 this_sequence A068933 A068934 A068935`
	KEYWORD	`hard,more,nonn`
	AUTHOR	`David Wasserman (dwasserm(AT)earthlink.net), Mar 08 2002`
	EXTENSIONS	`a(22) corrected and a(23) added by J. S. Kimberley (Jason.Kimberley(AT)newcastle.edu.au), Sep 28 2009`

page 1

Search completed in 0.002 seconds

Last modified November 24 14:25 EST 2009. Contains 167438 sequences.