A136286 - OEIS

This site is supported by donations to The OEIS Foundation.

A136286

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

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

	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.` `Sequence in context: A205652 A205089 A017032 * A176764 A206319 A090650` `Adjacent sequences: A136283 A136284 A136285 * A136287 A136288 A136289`
	KEYWORD	`nonn,more`
	AUTHOR	`D. E. Knuth, Mar 31 2008`

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

Last modified February 14 19:37 EST 2012. Contains 205663 sequences.