cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A360353 Number of edges among all distinct circles that can be constructed from an n X n square grid of points when each pair of points is connected by a circle and the points lie at the ends of a diameter of the circle.

Original entry on oeis.org

16, 244, 2580, 15788, 67144, 227888, 668008, 1712960, 3968028
Offset: 2

Views

Author

Scott R. Shannon, Feb 04 2023

Keywords

Comments

A circle is constructed for every pair of points on the n X n grid, the points lying at the ends of a diameter of the circle. The number of distinct circles constructed from the n X n grid is A360350(n).
See A360351 and A360352 for images of the circles.

Crossrefs

Cf. A360351 (vertices), A360352 (regions), A360354 (k-gons), A360350 (distinct circles), A359934.

Formula

a(n) = A360351(n) + A360352(n) - 1 by Euler's formula.