A358889 -id:A358889 - cp's OEIS frontend

A358882 The number of regions in a Farey diagram of order (n,n).

4, 56, 504, 2024, 8064, 18200, 50736, 99248, 202688, 343256, 657904, 983008, 1708672, 2485968, 3755184, 5289944, 8069736, 10539792, 15387320, 19913840

Offset: 1

Scott R. Shannon and N. J. A. Sloane, Dec 05 2022

See A358298 and also the linked references for further details.

The first diagram where not all edge points are connected is n = 3. For example a line connecting points (0,1/3) and (1/3,0) has equation 3*y - 6*x - 1 = 0, and as one of the x or y coefficients is greater than n (3 in this case) the line is not included.

Alain Daurat, M. Tajine, M. Zouaoui, About the frequencies of some patterns in digital planes. Application to area estimators. Computers & Graphics. 33.1 (2009), 11-20.
Daniel Khoshnoudirad, Farey lines defining Farey diagrams and application to some discrete structures. Applicable Analysis and Discrete Mathematics. 9 (2015), 73-84.
Scott R. Shannon, Image for n = 1.
Scott R. Shannon, Image for n = 2.
Scott R. Shannon, Image for n = 3.
Scott R. Shannon, Image for n = 4.
Scott R. Shannon, Image for n = 5.
Scott R. Shannon, Image for n = 6.
Scott R. Shannon, Image for n = 7.
Scott R. Shannon, Image for n = 8.
Wikipedia, Farey sequence.

Cf. A358883 (vertices), A358884 (edges), A358885 (k-gons), A006842, A006843, A005728, A358886.
See A358298 for definition of Farey diagram Farey(m,n).
The Farey Diagrams Farey(m,n) are studied in A358298-A358307 and A358882-A358885, the Completed Farey Diagrams of order (m,n) in A358886-A358889.

a(n) = A358884(n) - A358883(n) + 1 by Euler's formula.

A358886 Number of regions formed inside a square with edge length 1 by the straight line segments mutually connecting all vertices and points that divide the sides into segments with lengths equal to the Farey series of order n = A006842(n,k)/A006843(n,k), k = 1..A005728(n).

Original entry on oeis.org

4, 56, 1040, 6064, 53104, 115496, 629920, 1457744, 3952264, 6835568

Offset: 1

Scott R. Shannon and N. J. A. Sloane, Dec 05 2022

The number of points along each edge is given by A005728(n).

We call this graph the Completed Farey Diagram of order (n,k). The (ordinary) Farey diagram Farey(n,k) is a subgraph. In the latter graph, not all pairs of boundary points are joined by lines.

Scott R. Shannon, Image for n = 1.
Scott R. Shannon, Image for n = 2.
Scott R. Shannon, Image for n = 3.
Scott R. Shannon, Image for n = 4.
Scott R. Shannon, Image for n = 5.
Scott R. Shannon, Image for n = 6.
Wikipedia, Farey sequence.

Cf. A358888 (edges), A358887 (vertices), A358889 (k-gons), A006842, A006843, A005728, A358882.

The Farey Diagrams Farey(m,n) are studied in A358298-A358307 and A358882-A358885, the Completed Farey Diagrams of order (m,n) in A358886-A358889.

a(n) = A358888(n) - A358887(n) + 1 by Euler's formula.

A358885 Table read by rows: T(n,k) = the number of regions with k sides, k >= 3, in a Farey diagram of order (n,n).

Original entry on oeis.org

4, 48, 8, 400, 104, 1568, 456, 6216, 1848, 13944, 4256, 38760, 11976, 75768, 23480, 154440, 48248, 261072, 82184, 500464, 157440, 747480, 235528, 1298584, 410088, 1890184, 595784, 2853416, 901768, 4015552, 1274392, 6127632, 1942104, 8002552, 2537240, 11683880, 3703440, 15123800, 4790040

Offset: 1

Scott R. Shannon and N. J. A. Sloane, Dec 05 2022

See the linked references for further details.
The first diagram where not all edge points are connected is n = 3. For example a line connecting points (0,1/3) and (1/3,0) has equation 3*y - 6*x - 1 = 0, and as one of the x or y coefficients is greater than n (3 in this case) the line is not included.
It would be nice to have a proof (or disproof) that the number of sides is always 3 or 4.

			The table begins:
4;
48, 8;
400, 104;
1568, 456;
6216, 1848;
13944, 4256;
38760, 11976;
75768, 23480;
154440, 48248;
261072, 82184;
500464, 157440;
747480, 235528;
1298584, 410088;
1890184, 595784;
2853416, 901768;
4015552, 1274392;
6127632, 1942104;
8002552, 2537240;
11683880, 3703440;
15123800, 4790040;
.
.

Alain Daurat et al., About the frequencies of some patterns in digital planes. Application to area estimators. Computers & graphics. 33.1 (2009), 11-20.
Daniel Khoshnoudirad, Farey lines defining Farey diagrams and application to some discrete structures. Applicable Analysis and Discrete Mathematics. 9 (2015), 73-84.
Scott R. Shannon, Image for n = 5.
Wikipedia, Farey sequence.

Cf.  A358882 (regions), A358883 (vertices), A358884 (edges), A006842, A006843, A005728, A358889.
See A358298 for definition of Farey diagram Farey(m,n).
The Farey Diagrams Farey(m,n) are studied in A358298-A358307 and A358882-A358885, the Completed Farey Diagrams of order (m,n) in A358886-A358889.

Sum of row n = A358882(n).

A358298 Array read by antidiagonals: T(n,k) (n>=0, k>=0) = number of lines defining the Farey diagram Farey(n,k) of order (n,k).

Original entry on oeis.org

2, 3, 3, 4, 6, 4, 6, 11, 11, 6, 8, 19, 20, 19, 8, 12, 29, 36, 36, 29, 12, 14, 43, 52, 60, 52, 43, 14, 20, 57, 78, 88, 88, 78, 57, 20, 24, 77, 100, 128, 124, 128, 100, 77, 24, 30, 97, 136, 162, 180, 180, 162, 136, 97, 30, 34, 121, 166, 216, 224, 252, 224, 216, 166, 121, 34

Offset: 0

Scott R. Shannon and N. J. A. Sloane, Dec 06 2022

We work with lines with equation ux + vy + w = 0 in the (x,y) plane.
This line has slope -u/v, and crosses the vertical y axis at the intercept point y = -w/v
For the Farey diagram Farey(m,n), u is an integer between -(m-1) and +(m-1), v is between -(n-1) and +(n-1) and w can be any integer.
The only lines that are used are those that hit the unit square 0 <= x <= 1, 0 <= y <= 1 in at least two points.
This means that we only need to look at w's with |w| <=  |u| + |v|.
T(m,n) is the number of such lines.
For illustrations of Farey(3,3) and Farey(3,4) see Khoshnoudirad (2015), Fig. 2, and Darat et al. (2009), Fig. 2. For further illustrations see A358882-A358885.

			The full array T(n,k), n >= 0, k>= 0, begins:
  2, 3, 4, 6, 8, 12, 14, 20, 24, 30, 34, 44, 48, 60,  ...
  3, 6, 11, 19, 29, 43, 57, 77, 97, 121, 145, 177, 205,  ...
  4, 11, 20, 36, 52, 78, 100, 136, 166, 210, 246, 302,  ...
  6, 19, 36, 60, 88, 128, 162, 216, 266, 326, 386, 468, ...
  8, 29, 52, 88, 124, 180, 224, 298, 360, 444, 518, 628, ...
  12, 43, 78, 128, 180, 252, 316, 412, 498, 608, 706,  ...
  14, 57, 100, 162, 224, 316, 388, 508, 608, 738, 852, ...
  ...

Alain Daurat, M. Tajine, and M. Zouaoui, About the frequencies of some patterns in digital planes. Application to area estimators. Computers & Graphics. 33.1 (2009), 11-20.
Daniel Khoshnoudirad, Farey lines defining Farey diagrams and application to some discrete structures, Applicable Analysis and Discrete Mathematics, 9 (2015), 73-84; doi:10.2298/AADM150219008K. See Theorem 1, |DF(m,n)|.

Cf. A358299.
Row 0 is essentially A225531, row 1 is A358300, main diagonal is A358301.
The Farey Diagrams Farey(m,n) are studied in A358298-A358307 and A358882-A358885, the Completed Farey Diagrams of order (m,n) in A358886-A358889.

A005728 := proc(n) 1+add(numtheory[phi](i), i=1..n) ; end proc: # called F_n in the paper
Amn:=proc(m,n) local a,i,j;  # A331781 or equally A333295. Diagonal is A018805.
a:=0; for i from 1 to m do for j from 1 to n do
if igcd(i,j)=1 then a:=a+1; fi; od: od: a; end;
# The present sequence is:
Dmn:=proc(m,n) local d,t1,u,v,a; global A005728, Amn;
a:=A005728(m)+A005728(n);
t1:=0; for u from 1 to m do for v from 1 to n do
d:=igcd(u,v); if d>=1 then t1:=t1 + (u+v)*numtheory[phi](d)/d; fi; od: od:
a+2*t1-2*Amn(m,n); end;
for m from 1 to 8 do lprint([seq(Dmn(m,n),n=1..20)]); od:

A005728[n_] := 1 + Sum[EulerPhi[i], {i, 1, n}];
Amn[m_, n_] := Module[{a, i, j}, a = 0; For[i = 1, i <= m, i++, For[j = 1, j <= n, j++, If[GCD[i, j] == 1, a = a + 1]]]; a];
Dmn[m_, n_] := Module[{d, t1, u, v, a}, a = A005728[m] + A005728[n]; t1 = 0; For[u = 1, u <= m, u++, For[v = 1, v <= n, v++, d = GCD[u, v]; If[d >= 1 , t1 = t1 + (u + v)* EulerPhi[d]/d]]]; a + 2*t1 - 2*Amn[m, n]];
Table[Dmn[m - n, n], {m, 0, 10}, {n, 0, m}] // Flatten (* Jean-François Alcover, Apr 03 2023, after Maple code *)

A358307 Main diagonal of array in A358304, divided by 2.

Original entry on oeis.org

0, 1, 5, 16, 33, 67, 102, 171, 241, 346, 452, 627, 769, 1015, 1228, 1512, 1796, 2220, 2541, 3072, 3500, 4070, 4605, 5386, 5958, 6848, 7598, 8561, 9419, 10665, 11525, 12950, 14094, 15524, 16812, 18528, 19818, 21852, 23463, 25467, 27187, 29687, 31409, 34160, 36310, 38890, 41255, 44544, 46840, 50347, 53037, 56477, 59489

Offset: 0

Scott R. Shannon and N. J. A. Sloane, Dec 06 2022

nonn

The Farey Diagrams Farey(m,n) are studied in A358298-A358307 and A358882-A358885, the Completed Farey Diagrams of order (m,n) in A358886-A358889.

A358887 Number of vertices formed inside a square with edge length 1 by the straight line segments mutually connecting all vertices and points that divide the sides into segments with lengths equal to the Farey series of order n = A006842(n,k)/A006843(n,k), k = 1..A005728(n).

Original entry on oeis.org

5, 37, 705, 4549, 42357, 94525, 531485, 1250681, 3440621, 5985201

Offset: 1

Scott R. Shannon and N. J. A. Sloane, Dec 05 2022

The number of points along each edge is given by A005728(n).

Scott R. Shannon, Image for n = 1.
Scott R. Shannon, Image for n = 2.
Scott R. Shannon, Image for n = 3.
Scott R. Shannon, Image for n = 4.
Wikipedia, Farey sequence.

Cf. A358888 (edges), A358886 (regions), A358889 (k-gons), A006842, A006843, A005728, A358882, A358883.

The Farey Diagrams Farey(m,n) are studied in A358298-A358307 and A358882-A358885, the Completed Farey Diagrams of order (m,n) in A358886-A358889.

a(n) = A358888(n) - A358886(n) + 1 by Euler's formula.

A358888 Number of edges formed inside a square with edge length 1 by the straight line segments mutually connecting all vertices and points that divide the sides into segments with lengths equal to the Farey series of order n = A006842(n,k)/A006843(n,k), k = 1..A005728(n).

Original entry on oeis.org

8, 92, 1744, 10612, 95460, 210020, 1161404, 2708424, 7392884, 12820768

Offset: 1

Scott R. Shannon and N. J. A. Sloane, Dec 05 2022

The number of points along each edge is given by A005728(n).

See A358886 and A358887 for images of the square.

Wikipedia, Farey sequence.

Cf. A358886 (regions), A358887 (vertices), A358889 (k-gons), A006842, A006843, A005728, A358882, A358884.

The Farey Diagrams Farey(m,n) are studied in A358298-A358307 and A358882-A358885, the Completed Farey Diagrams of order (m,n) in A358886-A358889.

a(n) = A358886(n) + A358887(n) - 1 by Euler's formula.

A358883 The number of vertices in a Farey diagram of order (n,n).

Original entry on oeis.org

5, 37, 313, 1253, 4977, 11253, 31393, 61409, 125525, 212785, 407757, 609361, 1059497, 1541005, 2328621, 3282329, 5006113, 6538721, 9545621, 12352197

Offset: 1

Scott R. Shannon and N. J. A. Sloane, Dec 05 2022

See the linked references for further details.

The first diagram where not all edge points are connected is n = 3. For example a line connecting points (0,1/3) and (1/3,0) has equation 3*y - 6*x - 1 = 0, and as one of the x or y coefficients is greater than n (3 in this case) the line is not included.

Alain Daurat et al., About the frequencies of some patterns in digital planes. Application to area estimators. Computers & graphics. 33.1 (2009), 11-20.
Daniel Khoshnoudirad, Farey lines defining Farey diagrams and application to some discrete structures. Applicable Analysis and Discrete Mathematics. 9 (2015), 73-84.
Scott R. Shannon, Image for n = 1.
Scott R. Shannon, Image for n = 2.
Scott R. Shannon, Image for n = 3.
Scott R. Shannon, Image for n = 4.
Scott R. Shannon, Image for n = 5.
Wikipedia, Farey sequence.

Cf. A358882 (regions), A358884 (edges), A358885 (k-gons), A006842, A006843, A005728, A358887.
See A358298 for definition of Farey diagram Farey(m,n).
The Farey Diagrams Farey(m,n) are studied in A358298-A358307 and A358882-A358885, the Completed Farey Diagrams of order (m,n) in A358886-A358889.

a(n) = A358884(n) - A358882(n) + 1 by Euler's formula.

A358951 Irregular table read by rows: T(n,k) = number of k-gons, k >= 3, formed inside a triangle with edge length 1 by the straight line segments mutually connecting all vertices and points that divide the sides into segments with lengths equal to the Farey series of order n = A006842(n,m)/A006843(n,m), m = 1..A005728(n).

Original entry on oeis.org

1, 12, 180, 42, 6, 810, 576, 72, 6, 6786, 4932, 744, 48, 6, 13662, 12522, 2568, 258, 12, 72582, 64932, 14376, 1632, 36, 6, 164484, 155088, 38688, 5958, 414, 18, 439524, 422370, 114804, 18462, 1392, 120, 750108, 749928, 211518, 35226, 3336, 204, 6, 2265462, 2240994, 647184, 109602, 10230, 666, 18

Offset: 1

Scott R. Shannon and N. J. A. Sloane, Dec 07 2022

The number of points along each edge is given by A005728(n).

			The table begins:
1;
12;
180, 42, 6;
810, 576, 72, 6;
6786, 4932, 744, 48, 6;
13662, 12522, 2568, 258, 12;
72582, 64932, 14376, 1632, 36, 6;
164484, 155088, 38688, 5958, 414, 18;
439524, 422370, 114804, 18462, 1392, 120;
750108, 749928, 211518, 35226, 3336, 204, 6;
2265462, 2240994, 647184, 109602, 10230, 666, 18;
3263436, 3312270, 990072, 176172, 18294, 1188, 66;
.
.

Scott R. Shannon, Image for n = 7.
Wikipedia, Farey sequence.

Cf. A358948 (regions), A358949 (vertices), A358950 (edges), A358889, A006842, A006843, A005728, A358882.

Sum of row n = A358948(n).

A358884 The number of edges in a Farey diagram of order (n,n).

Original entry on oeis.org

8, 92, 816, 3276, 13040, 29452, 82128, 160656, 328212, 556040, 1065660, 1592368, 2768168, 4026972, 6083804, 8572272, 13075848, 17078512, 24932940, 32266036

Offset: 1

Scott R. Shannon and N. J. A. Sloane, Dec 05 2022

See the linked references for further details.

The first diagram where not all edge points are connected is n = 3. For example a line connecting points (0,1/3) and (1/3,0) has equation 3*y - 6*x - 1 = 0, and as one of the x or y coefficients is greater than n (3 in this case) the line is not included.

Alain Daurat et al., About the frequencies of some patterns in digital planes. Application to area estimators. Computers & graphics. 33.1 (2009), 11-20.
Daniel Khoshnoudirad, Farey lines defining Farey diagrams and application to some discrete structures. Applicable Analysis and Discrete Mathematics. 9 (2015), 73-84.
Wikipedia, Farey sequence.

Cf. A358882 (regions), A358883 (vertices), A358885 (k-gons), A006842, A006843, A005728, A358888.
See A358298 for definition of Farey diagram Farey(m,n).
The Farey Diagrams Farey(m,n) are studied in A358298-A358307 and A358882-A358885, the Completed Farey Diagrams of order (m,n) in A358886-A358889.

a(n) = A358882(n) + A358883(n) - 1 by Euler's formula.

cp's OEIS Frontend

A358882 The number of regions in a Farey diagram of order (n,n).

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A358886 Number of regions formed inside a square with edge length 1 by the straight line segments mutually connecting all vertices and points that divide the sides into segments with lengths equal to the Farey series of order n = A006842(n,k)/A006843(n,k), k = 1..A005728(n).

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A358885 Table read by rows: T(n,k) = the number of regions with k sides, k >= 3, in a Farey diagram of order (n,n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A358298 Array read by antidiagonals: T(n,k) (n>=0, k>=0) = number of lines defining the Farey diagram Farey(n,k) of order (n,k).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A358307 Main diagonal of array in A358304, divided by 2.

Views

Author

Keywords

Crossrefs

A358887 Number of vertices formed inside a square with edge length 1 by the straight line segments mutually connecting all vertices and points that divide the sides into segments with lengths equal to the Farey series of order n = A006842(n,k)/A006843(n,k), k = 1..A005728(n).

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A358888 Number of edges formed inside a square with edge length 1 by the straight line segments mutually connecting all vertices and points that divide the sides into segments with lengths equal to the Farey series of order n = A006842(n,k)/A006843(n,k), k = 1..A005728(n).

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A358883 The number of vertices in a Farey diagram of order (n,n).

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A358884 The number of edges in a Farey diagram of order (n,n).

Views

Author

Keywords

Comments

Links