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

 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
 16, 244, 2580, 15788, 67144, 227888, 668008, 1712960, 3968028 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 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. LINKS Table of n, a(n) for n=2..10. FORMULA a(n) = A360351(n) + A360352(n) - 1 by Euler's formula. CROSSREFS Cf. A360351 (vertices), A360352 (regions), A360354 (k-gons), A360350 (distinct circles), A359934. Sequence in context: A138460 A182148 A304170 * A217635 A183431 A222383 Adjacent sequences: A360350 A360351 A360352 * A360354 A360355 A360356 KEYWORD nonn,more AUTHOR Scott R. Shannon, Feb 04 2023 STATUS approved

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.

Last modified August 12 04:50 EDT 2024. Contains 375085 sequences. (Running on oeis4.)