login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006787 Number of n-node graphs with no cycles of length less than 5.
(Formerly M0792)
5
1, 2, 3, 6, 11, 23, 48, 114, 293, 869, 2963, 12066, 58933, 347498, 2455693, 20592932, 202724920, 2322206466, 30743624324 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Includes graphs with no cycles at all as well as graphs with girth greater than 5.

REFERENCES

Brendan McKay, personal communication.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Brendan D. McKay, Isomorph-free exhaustive generation, Table 2.

Brendan D. McKay, Isomorph-Free Exhaustive Generation, J. Algorithms, vol. 26 iss. 2 (1998), 306-324.

CROSSREFS

Cf. A054760, A000066.

Sequence in context: A130131 A123465 A000055 * A176425 A000992 A036648

Adjacent sequences:  A006784 A006785 A006786 * A006788 A006789 A006790

KEYWORD

nonn,changed

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Definition corrected by Brendan McKay, Apr 27 2007

a(18)-a(19) (from the McKay reference) added by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jun 17 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 17 23:55 EST 2012. Contains 206085 sequences.