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.

A359654 Number of vertices formed in a square with edge length 1 by straight line segments when connecting the internal edge points that divide the sides into segments with lengths equal to the Farey series of order n to the equivalent points on the opposite side of the square.

This page as a plain text file.
%I A359654 #8 Jan 10 2023 18:22:29
%S A359654 4,9,77,593,6749,15569,93281,222933,623409,1087393,3453289,5011009,
%T A359654 13271517
%N A359654 Number of vertices formed in a square with edge length 1 by straight line segments when connecting the internal edge points that divide the sides into segments with lengths equal to the Farey series of order n to the equivalent points on the opposite side of the square.
%C A359654 The number of points internal to each edge is given by A005728(n) - 2.
%H A359654 Scott R. Shannon, <a href="/A359654/a359654.png">Image for n = 2</a>.
%H A359654 Scott R. Shannon, <a href="/A359654/a359654_1.png">Image for n = 3</a>.
%H A359654 Scott R. Shannon, <a href="/A359654/a359654_2.png">Image for n = 4</a>.
%H A359654 Scott R. Shannon, <a href="/A359654/a359654_3.png">Image for n = 5</a>.
%H A359654 Scott R. Shannon, <a href="/A359654/a359654_4.png">Image for n = 6</a>.
%F A359654 a(n) = A359655(n) - A359653(n) + 1 by Euler's formula.
%Y A359654 Cf. A359653 (regions), A359655 (edges), A359656 (k-gons), A005728, A358887, A358883, A355799, A358949, A006842, A006843.
%K A359654 nonn,more
%O A359654 1,1
%A A359654 _Scott R. Shannon_ and _N. J. A. Sloane_, Jan 10 2023