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.

A370980 If n is even, (n^2-2*n+2)/2, otherwise (n^2-n+2)/2.

Original entry on oeis.org

1, 1, 1, 4, 5, 11, 13, 22, 25, 37, 41, 56, 61, 79, 85, 106, 113, 137, 145, 172, 181, 211, 221, 254, 265, 301, 313, 352, 365, 407, 421, 466, 481, 529, 545, 596, 613, 667, 685, 742, 761, 821, 841, 904, 925, 991, 1013, 1082, 1105, 1177, 1201, 1276, 1301, 1379, 1405, 1486, 1513, 1597, 1625, 1712, 1741, 1831, 1861, 1954
Offset: 0

Views

Author

Keywords

Comments

Total number of circles in A371373 and A371253, if in the later all the circular arcs are completed to form full circles.
The sequence also gives the number of vertices created from circle intersections when a circle of radius r is drawn around each of n equally spaced points on the circumference of a circle of radius r. The number of regions in these constructions is A093005(n) and the number of edges is A183207(n). See the attached images. - Scott R. Shannon, Jul 06 2024.

Examples

			a(n) = 1+n*floor((n-1)/2) = 1+n*A004526(n-1). - _Chai Wah Wu_, Mar 23 2024
		

Crossrefs

Programs

Formula

a(n) = A183207(n) - A093005(n) + 1, by Euler's formula. - Scott R. Shannon, Jul 07 2024