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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006856 Maximal number of edges in n-node graph of girth 5.
(Formerly M0624)
2
0, 1, 2, 3, 5, 6, 8, 10, 12, 15, 16, 18, 21, 23, 26, 28, 31, 34, 38, 41, 44, 47, 50, 54, 57, 61, 65, 68, 72, 76 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

REFERENCES

David K. Garnick, Y. H. Harris Kwong and Felix Lazebnik, Extremal Graphs without Three-Cycles or Four-Cycles, Journal of Graph Theory, 17 (1993), 633-645.

Brendan McKay, personal communication.

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

CROSSREFS

Sequence in context: A120836 A011864 A045919 * A140199 A072190 A177445

Adjacent sequences:  A006853 A006854 A006855 * A006857 A006858 A006859

KEYWORD

nonn,more,changed

AUTHOR

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

EXTENSIONS

Two more terms from David Garnick (dgarnick(AT)gmail.com), Jan 09 2007

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 16 07:39 EST 2012. Contains 205881 sequences.