|
|
A006856
|
|
Maximal number of edges in n-node graph of girth at least 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, 80, 85, 87, 90, 95, 99, 104, 109, 114, 120, 124, 129, 134, 139, 145, 150, 156, 162, 168, 175, 176, 178, 181
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
The unique graph for a(50)=175 is the Hoffman-Singleton graph.
a(53) is at least 181. (End)
a(53) is exactly 181. a(54)-a(56) are at least 185,189,193. - Brendan McKay, Jan 07 2023
|
|
REFERENCES
|
Brendan McKay, personal communication.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Two more terms from David Garnick (dgarnick(AT)gmail.com), Jan 09 2007
|
|
STATUS
|
approved
|
|
|
|