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.
A384703
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.
Terms
- a(0) =0a(1) =4a(2) =54a(3) =416a(4) =2182a(5) =7884a(6) =23294a(7) =56982a(8) =126310a(9) =253564a(10) =477462a(11) =844524a(12) =1424316
External references
- oeis: A384703