Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006856
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006856 Maximal number of edges in n-node graph of girth 5.
(Formerly M0624)
+0
3
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; listen)
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.

B. D. 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 this_sequence A140199 A072190 A022826

Adjacent sequences: A006853 A006854 A006855 this_sequence A006857 A006858 A006859

KEYWORD

nonn,more

AUTHOR

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

EXTENSIONS

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research