id:A126757 - OEIS Search Results

Search: id:A126757

Displaying 1-1 of 1 results found.

page 1

Number of n-node connected graphs with no cycles of length less than 5.

+0
2

1, 1, 1, 2, 4, 8, 18, 47, 137, 464, 1793, 8167, 43645, 275480, 2045279, 17772647, 179593823, 2098423758, 28215583324 (list; graph; listen)

	OFFSET	`1,4`
	LINKS	`Keith M. Briggs, Combinatorial Graph Theory`
	FORMULA	`This is the inverse Euler transform of A006787. - Conjectured by Vladeta Jovovic (vladeta(AT)eunet.rs), Jun 16 2008, proved by Max Alekseyev and Brendan McKay, Jun 17 2008`
	CROSSREFS	`Cf. A006787, A140440.` `Sequence in context: A000117 A006771 A113989 this_sequence A034766 A099785 A166952` `Adjacent sequences: A126754 A126755 A126756 this_sequence A126758 A126759 A126760`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Feb 18 2007`
	EXTENSIONS	`Definition corrected by Max Alekseyev and Brendan McKay, Jun 17 2008`

page 1

Search completed in 0.002 seconds

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.