|
%I #24 Mar 11 2018 13:19:01
%S 1,4,10,24,49,80,162,230,451,444,884,1036,1845,1840,3026,2412,4921,
%T 4960,8022,7854,10925,9864,16150,15860,22545,22204,30218,21300,41261,
%U 39776,51678,51102,67025,58680,83990,82802,104715,102480,126362,107184,155445,152020
%N Number of maximal cliques in the n-polygon diagonal intersection graph.
%C Maximal cliques in the n-polygon diagonal intersection graph are either triangles or edges that are not contained in a triangle. - _Andrew Howroyd_, Mar 11 2018
%H Andrew Howroyd, <a href="/A291949/b291949.txt">Table of n, a(n) for n = 3..100</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MaximalClique.html">Maximal Clique</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PolygonDiagonalIntersectionGraph.html">Polygon Diagonal Intersection Graph</a>
%Y Cf. A062361, A135565, A300524.
%K nonn
%O 3,2
%A _Eric W. Weisstein_, Mar 09 2018
%E Terms a(15) and beyond from _Andrew Howroyd_, Mar 11 2018
|
