login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 8

%I #13 Feb 04 2023 20:39:23

%S 16,244,2580,15788,67144,227888,668008,1712960,3968028

%N 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.

%C 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).

%C See A360351 and A360352 for images of the circles.

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

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

%K nonn,more

%O 2,1

%A _Scott R. Shannon_, Feb 04 2023

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 18 05:33 EDT 2024. Contains 374377 sequences. (Running on oeis4.)