id:A136284 - OEIS Search Results

Search: id:A136284

Displaying 1-1 of 1 results found.

page 1

Number of graphs on n labeled nodes with maximal degree exactly 2.

+0
1

0, 0, 4, 31, 227, 1782, 15564, 151455, 1635703, 19457998, 252962528, 3568119351, 54262590843, 884831668974, 15397747311556, 284767367151241, 5576696534340377, 115269731259650802, 2507575460681918232 (list; graph; listen)

	OFFSET	`1,3`
	REFERENCES	`D. E. Knuth, The Art of Computer Programming, Vol. 4A, Section 7.1.4.`
	FORMULA	`Equals A136281 - A000085.`
	CROSSREFS	`Cf. A000085 (degree at most 1), A136281-A136286.` `Adjacent sequences: A136281 A136282 A136283 this_sequence A136285 A136286 A136287` `Sequence in context: A059938 A005216 A014537 this_sequence A039765 A001091 A077615`
	KEYWORD	`nonn`
	AUTHOR	`D. E. Knuth, Mar 31 2008`
	EXTENSIONS	`More terms from Alois P. Heinz (heinz(AT)hs-heilbronn.de), Sep 12 2008`

page 1

Search completed in 0.002 seconds

Last modified January 7 17:35 EST 2009. Contains 152824 sequences.

AT&T Labs Research