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.
%I A358884 #13 Dec 06 2022 19:33:37 %S A358884 8,92,816,3276,13040,29452,82128,160656,328212,556040,1065660,1592368, %T A358884 2768168,4026972,6083804,8572272,13075848,17078512,24932940,32266036 %N A358884 The number of edges in a Farey diagram of order (n,n). %C A358884 See the linked references for further details. %C A358884 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. %H A358884 Alain Daurat et al., <a href="https://doi.org/10.1016/j.cag.2008.11.001">About the frequencies of some patterns in digital planes. Application to area estimators</a>. Computers & graphics. 33.1 (2009), 11-20. %H A358884 Daniel Khoshnoudirad, <a href="https://doi.org/10.2298/AADM150219008K">Farey lines defining Farey diagrams and application to some discrete structures</a>. Applicable Analysis and Discrete Mathematics. 9 (2015), 73-84. %H A358884 Wikipedia, <a href="https://en.wikipedia.org/wiki/Farey_sequence">Farey sequence</a>. %F A358884 a(n) = A358882(n) + A358883(n) - 1 by Euler's formula. %Y A358884 Cf. A358882 (regions), A358883 (vertices), A358885 (k-gons), A006842, A006843, A005728, A358888. %Y A358884 See A358298 for definition of Farey diagram Farey(m,n). %Y 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. %K A358884 nonn,more %O A358884 1,1 %A A358884 _Scott R. Shannon_ and _N. J. A. Sloane_, Dec 05 2022