The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #11 Dec 28 2022 10:34:32
%S 8,18,41,80,169,250,514,682,1233,1346,2614,2970,4801,5330,8348,7580,
%T 13472,14422,20455,21738,30591,28082,43276,45294,59806,62050,80911,
%U 66812,106393,110114,139162,142972,177416,171434,223851,228876,278500
%N Number of (not necessarily maximal) cliques in the n-polygon diagonal intersection graph.
%C Equal to 1 + vertex count + edge count + triangle count.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Clique.html">Clique</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PolygonDiagonalIntersectionGraph.html">Polygon Diagonal Intersection Graph</a>
%F a(n) = 1 + A007569(n) + A062361(n) + A135565(n).
%Y Cf. A007569 (vertex count).
%Y Cf. A062361 (edge count).
%Y Cf. A135565 (triangle count).
%K nonn
%O 3,1
%A _Eric W. Weisstein_, Mar 08 2018