id:A136286 - OEIS Search Results

Search: id:A136286

Displaying 1-1 of 1 results found.

page 1

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

+0
6

0, 0, 0, 0, 256, 15381, 815867, 47818683, 3291232419, 270038320842, 26366544332292, 3038643940889754 (list; graph; listen)

	OFFSET	`1,5`
	REFERENCES	`D. E. Knuth, The Art of Computer Programming, Vol. 4A, Section 7.1.4.`
	FORMULA	`Equals A136283 - A136282.`
	CROSSREFS	`Cf. A000085 (degree at most 1), A136281-A136285.` `Adjacent sequences: A136283 A136284 A136285 this_sequence A136287 A136288 A136289` `Sequence in context: A128991 A016960 A017032 this_sequence A090650 A017116 A017212`
	KEYWORD	`nonn,more`
	AUTHOR	`D. E. Knuth, Mar 31 2008`

page 1

Search completed in 0.002 seconds

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