A359693 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A359693

Number of edges in a regular drawing of a complete bipartite graph where the vertex positions on each part equal the Farey series of order n.

6, 24, 162, 670, 4456, 8942, 44470, 98902, 259114, 438552, 1330566, 1897164, 4893752, 7246502, 11544278, 17678880

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

The number of vertices along each edge is A005728(n). No formula for a(n) is known.

See A359690 and A359692 for images of the graph.

LINKS

Table of n, a(n) for n=1..16.

Eric Weisstein's World of Mathematics, Complete Bipartite Graph.

Wikipedia, Farey sequence.

FORMULA

a(n) = A359690(n) + A359692(n) - 2*A005728(n) + 1 by Euler's formula.

CROSSREFS

Cf. A359690 (vertices), A359691 (crossings), A359692 (regions), A359694 (k-gons), A005728, A290132, A359655, A358888, A358884, A006842, A006843.

Sequence in context: A122829 A232688 A221980 * A225827 A375627 A349498

Adjacent sequences: A359690 A359691 A359692 * A359694 A359695 A359696

KEYWORD

nonn,more

AUTHOR

Scott R. Shannon and N. J. A. Sloane, Jan 11 2023

STATUS

approved