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 points where circles intersect.
A384701
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 points where circles intersect.
Terms
- a(0) =2a(1) =4a(2) =18a(3) =172a(4) =978a(5) =3672a(6) =11034a(7) =27241a(8) =60804a(9) =122741a(10) =232138a(11) =412263a(12) =697058
External references
- oeis: A384701