A291949 - OEIS

A291949

Number of maximal cliques in the n-polygon diagonal intersection graph.

1, 4, 10, 24, 49, 80, 162, 230, 451, 444, 884, 1036, 1845, 1840, 3026, 2412, 4921, 4960, 8022, 7854, 10925, 9864, 16150, 15860, 22545, 22204, 30218, 21300, 41261, 39776, 51678, 51102, 67025, 58680, 83990, 82802, 104715, 102480, 126362, 107184, 155445, 152020

(list; graph; refs; listen; history; text; internal format)

OFFSET

3,2

COMMENTS

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

LINKS

Andrew Howroyd, Table of n, a(n) for n = 3..100

Eric Weisstein's World of Mathematics, Maximal Clique

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

CROSSREFS

Cf. A062361, A135565, A300524.

Sequence in context: A143696 A058514 A182094 * A001979 A209970 A211392

Adjacent sequences: A291946 A291947 A291948 * A291950 A291951 A291952

KEYWORD

nonn

AUTHOR

Eric W. Weisstein, Mar 09 2018

EXTENSIONS

Terms a(15) and beyond from Andrew Howroyd, Mar 11 2018

STATUS

approved