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.

Showing 1-3 of 3 results.

A370976 Let G_n denote the planar graph defined in A358746 with the addition, if n is odd, of the circle containing the initial n points; sequence gives the number of regions in G_n.

Original entry on oeis.org

1, 1, 10, 12, 71, 85, 288, 264, 811, 821, 1904, 1740, 3823, 3725, 6886, 6448, 11765, 11125, 18336, 17160, 27637, 26797, 40090, 37176, 56851, 54653, 77734, 74788, 103763, 101041, 136866, 131744, 176617, 172109, 223966, 216900, 281127, 273829, 348622, 337480, 425991, 416641
Offset: 1

Views

Author

Scott R. Shannon and N. J. A. Sloane, Mar 25 2024

Keywords

Comments

If n is even the circle through the initial n points is already part of the graph.
In other words, draw a circle and place n equally spaced points around it; for each pair of poins X, Y, draw a circle with diameter XY; the union of these circles is the graph G_n.
For the numbers of vertices and edges in G_n see A358746 and A370977.
For other images for n even, see A358782 (for even n, A358782 and the present sequence agree).

Links

Crossrefs

Cf. A358746, A358782, A358783, A370977, A370978, A370979.

Formula

a(n) = A358782(n) if n even, a(n) = A358782(n) + n if n odd.

A370979 Draw a regular n-gon and the enclosing circle, then for each pair of vertices X, Y, draw a circle with diameter XY; the union of these figures is the graph H_n; sequence gives number of edges in H_n.

Original entry on oeis.org

1, 4, 21, 20, 135, 144, 553, 440, 1575, 1460, 3729, 3132, 7527, 6888, 13605, 12016, 23307, 20988, 36385, 32420, 54915, 51216, 79741, 70776, 113175, 105300, 154845, 144508, 206799, 195840, 272893, 255840, 352275, 335036, 446845, 422820, 561031, 534736, 695877, 659480, 850463, 815724
Offset: 1

Views

Author

Scott R. Shannon and N. J. A. Sloane, Mar 25 2024

Keywords

Comments

For the numbers of vertices and regions in G_n see A358746 and A370978.
H_n is the union of the graph G_n defined in A370976 and the polygon through the initial n points.

Crossrefs

Cf. A358746, A358782, A358783, A370976, A370977, A370978.

Formula

a(n) = A358783(n) if n even, a(n) = A358783(n) + n if n odd.
a(n) = A358783(n) + n if n even, a(n) = A358783(n) + 3*n if n odd.

A370978 Draw a regular n-gon and the enclosing circle, then for each pair of vertices X, Y, draw a circle with diameter XY; the union of these figures is the graph H_n; sequence gives number of regions in H_n.

Original entry on oeis.org

1, 3, 16, 16, 81, 91, 302, 272, 829, 831, 1926, 1752, 3849, 3739, 6916, 6464, 11799, 11143, 18374, 17180, 27679, 26819, 40136, 37200, 56901, 54679, 77788, 74816, 103821, 101071, 136928, 131776, 176683, 172143, 224036, 216936, 281201, 273867, 348700, 337520, 426073, 416683
Offset: 1

Views

Author

Scott R. Shannon and N. J. A. Sloane, Mar 25 2024

Keywords

Comments

H_n is the union of the graph G_n defined in A370976 and the polygon through the initial n points.

Links

Crossrefs

Cf. A358746, A358782, A358783, A370976, A370977, A370979.

Formula

a(n) = A358782(n) + n if n even, a(n) = A358782(n) + 3*n if n odd.
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.