This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A300524 #12 Feb 16 2025 08:33:53 %S A300524 8,18,41,80,169,250,514,682,1233,1346,2614,2970,4801,5330,8348,7580, %T A300524 13472,14422,20455,21738,30591,28082,43276,45294,59806,62050,80911, %U A300524 66812,106393,110114,139162,142972,177416,171434,223851,228876,278500 %N A300524 Number of (not necessarily maximal) cliques in the n-polygon diagonal intersection graph. %C A300524 Equal to 1 + vertex count + edge count + triangle count. %H A300524 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Clique.html">Clique</a> %H A300524 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PolygonDiagonalIntersectionGraph.html">Polygon Diagonal Intersection Graph</a> %F A300524 a(n) = 1 + A007569(n) + A062361(n) + A135565(n). %Y A300524 Cf. A007569 (vertex count). %Y A300524 Cf. A062361 (edge count). %Y A300524 Cf. A135565 (triangle count). %K A300524 nonn %O A300524 3,1 %A A300524 _Eric W. Weisstein_, Mar 08 2018