Maximum number of edges in an n-node squarefree graph, or, in a graph containing no 4-cycle, or no C_4.

A006855

Maximum number of edges in an n-node squarefree graph, or, in a graph containing no 4-cycle, or no C_4.

Terms

    a(0) =0a(1) =1a(2) =3a(3) =4a(4) =6a(5) =7a(6) =9a(7) =11a(8) =13a(9) =16a(10) =18a(11) =21a(12) =24a(13) =27a(14) =30a(15) =33a(16) =36a(17) =39a(18) =42a(19) =46a(20) =50a(21) =52a(22) =56a(23) =59a(24) =63a(25) =67a(26) =71a(27) =76a(28) =80a(29) =85

External references