id:A000368 - OEIS Search Results

Search: id:A000368

Displaying 1-1 of 1 results found.

page 1

Number of connected graphs with one cycle of length 4.
(Formerly M3365 N1356)

+0
2

1, 1, 4, 9, 28, 71, 202, 542, 1507, 4114, 11381, 31349, 86845, 240567, 668553, 1860361, 5188767, 14495502, 40572216, 113743293, 319405695, 898288484, 2530058013, 7135848125, 20152898513, 56986883801 (list; graph; listen)

	OFFSET	`4,3`
	REFERENCES	`J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 150.`
	CROSSREFS	`Cf. A000226, A001429, A005703.` `Adjacent sequences: A000365 A000366 A000367 this_sequence A000369 A000370 A000371` `Sequence in context: A101973 A071258 A120333 this_sequence A094255 A069563 A059345`
	KEYWORD	`nonn`
	AUTHOR	`njas`
	EXTENSIONS	`More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 20 2000` `Definition improved by Frank Adams-Watters (FrankTAW(AT)Netscape.net), May 16 2006`

page 1

Search completed in 0.002 seconds

Last modified October 11 13:47 EDT 2008. Contains 144830 sequences.

AT&T Labs Research