id:A136285 - OEIS Search Results

Search: id:A136285

Displaying 1-1 of 1 results found.

page 1

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

+0
2

0, 0, 0, 23, 515, 10210, 221130, 5499165, 158416629, 5264924490, 200122583760, 8616774658305, 416417619554365, 22400104990385122, 1331442091500919580, 86886850043131597095, 6189883012226095338135, 478992622411196645778030 (list; graph; listen)

	OFFSET	`1,4`
	REFERENCES	`D. E. Knuth, The Art of Computer Programming, Vol. 4A, Section 7.1.4.`
	FORMULA	`Equals A136282 - A136281.`
	CROSSREFS	`Cf. A000085 (degree at most 1), A136281-A136286.` `Adjacent sequences: A136282 A136283 A136284 this_sequence A136286 A136287 A136288` `Sequence in context: A014905 A133283 A121903 this_sequence A114926 A118338 A097778`
	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