|
| |
|
|
A006855
|
|
Maximal edges in n-node squarefree graph.
(Formerly M2320)
|
|
0
|
|
|
|
0, 1, 3, 4, 6, 7, 9, 11, 13, 16, 18, 21, 24, 27, 30, 33, 36, 39, 42, 46, 50, 52
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,3
|
|
|
REFERENCES
|
M. Aigner and G. M. Ziegler, Proofs from The Book, Springer-Verlag, Berlin, 1999. Chap. 20 gives a simple proof of the upper bound (n/4)(1+sqrt(4n-3)) and of the fact that it is asymptotically good. - Chris Thompson, Aug 14, 2001
Brendan McKay, personal communication.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
|
Table of n, a(n) for n=1..22.
|
|
|
CROSSREFS
|
Sequence in context: A182770 A059552 A047516 * A066499 A201471 A136110
Adjacent sequences: A006852 A006853 A006854 * A006856 A006857 A006858
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
N. J. A. Sloane.
|
|
|
STATUS
|
approved
|
| |
|
|
