|
Search: id:A006855
|
|
|
| A006855 |
|
Maximal edges in n-node square-free graph.
(Formerly M2320)
|
|
+0
1
|
|
| 0, 1, 3, 4, 6, 7, 9, 11, 13, 16, 18, 21, 24, 27, 30, 33, 36, 39, 42, 46, 50, 52
(list; graph; listen)
|
|
|
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
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: A056576 A059552 A047516 this_sequence A066499 A136110 A032725
Adjacent sequences: A006852 A006853 A006854 this_sequence A006856 A006857 A006858
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
