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.
Original entry on oeis.org
0, 4, 54, 416, 2182, 7884, 23294, 56982, 126310, 253564, 477462, 844524, 1424316
Offset: 1
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.
Original entry on oeis.org
0, 1, 37, 245, 1205, 4213, 12261, 29742, 65507, 130824, 245325, 432262, 727259
Offset: 1
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.
Original entry on oeis.org
2, 4, 18, 172, 978, 3672, 11034, 27241, 60804, 122741, 232138, 412263, 697058
Offset: 1
A385159
Place a point on the integer coordinates, up to |n|, along all four axial directions on a Cartesian plane, and then join a circle through every unordered triple of non-collinear points: a(n) is the number of distinct circles created.
Original entry on oeis.org
1, 18, 99, 280, 633, 1098, 1915, 2928, 4329, 6010, 8331, 10752, 14113, 17778, 21987
Offset: 1
- Scott R. Shannon, Image for n = 2. The 4 x 2 = 8 starting points are shown as white dots.
Showing 1-4 of 4 results.
Comments