844524

Appears in sequences

• On a 2 X n grid of vertices, draw a circle through every unordered triple of non-collinear vertices: a(n) is the number of distinct edges in the planar graph formed from the intersections of the circles.at n=11A384703