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 (finite) regions created.
A384702
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 (finite) regions created.
Terms
- a(0) =0a(1) =1a(2) =37a(3) =245a(4) =1205a(5) =4213a(6) =12261a(7) =29742a(8) =65507a(9) =130824a(10) =245325a(11) =432262a(12) =727259
External references
- oeis: A384702