id:A136282 - OEIS Search Results

Search: id:A136282

Displaying 1-1 of 1 results found.

page 1

Number of graphs on n labeled nodes with degree at most 3.

+0
4

1, 2, 8, 64, 768, 12068, 236926, 5651384, 160054952, 5284391984, 200375581984, 8620342917808, 416471882713712, 22400989824444576, 1331457489258580672, 86887134810544955072, 6189888588922841477824, 478992737680928902742656, 40082045451011806706919808, 3612470757307682016196841216, 349398857659776033845292636416 (list; graph; listen)

	OFFSET	`1,2`
	REFERENCES	`D. E. Knuth, The Art of Computer Programming, Vol. 4A, Section 7.1.4.`
	FORMULA	`Binomial transform of A110041. - Vladeta Jovovic (vladeta(AT)Eunet.yu), May 20 2008`
	CROSSREFS	`Cf. A000085 (degree at most 1), A136281-A136286.` `Adjacent sequences: A136279 A136280 A136281 this_sequence A136283 A136284 A136285` `Sequence in context: A052707 A059862 A005612 this_sequence A092934 A139679 A005640`
	KEYWORD	`nonn`
	AUTHOR	`D. E. Knuth, Mar 31 2008`
	EXTENSIONS	`More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), May 20 2008`

page 1

Search completed in 0.002 seconds

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research