A300524 Number of (not necessarily maximal) cliques in the n-polygon diagonal intersection graph.

8, 18, 41, 80, 169, 250, 514, 682, 1233, 1346, 2614, 2970, 4801, 5330, 8348, 7580, 13472, 14422, 20455, 21738, 30591, 28082, 43276, 45294, 59806, 62050, 80911, 66812, 106393, 110114, 139162, 142972, 177416, 171434, 223851, 228876, 278500

Offset: 3

Author

Eric W. Weisstein, Mar 08 2018

Keywords

• nonn

Comments

Equal to 1 + vertex count + edge count + triangle count.

Links

• Eric Weisstein's World of Mathematics, Clique
• Eric Weisstein's World of Mathematics, Polygon Diagonal Intersection Graph

Crossrefs

Cf. A007569 (vertex count).

Cf. A062361 (edge count).

Cf. A135565 (triangle count).

Formula

a(n) = 1 + A007569(n) + A062361(n) + A135565(n).