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-10 of 18 results. Next

A347321 A146212(2*n).

Original entry on oeis.org

5, 37, 145, 471, 901, 2185, 3969, 5563, 11141, 17293, 21913, 36479, 50485, 51661, 90753, 118355, 139861, 191445, 238481
Offset: 2

Views

Author

N. J. A. Sloane, Sep 12 2021

Keywords

Comments

No formula is known.

Crossrefs

A344857 Number of polygons formed when every pair of vertices of a regular n-gon are joined by an infinite line.

Original entry on oeis.org

0, 0, 1, 4, 16, 42, 99, 176, 352, 540, 925, 1152, 2016, 2534, 3871, 4608, 6784, 6984, 11097, 12580, 17200, 19250, 25531, 26016, 36576, 39988, 50869, 55076, 68992, 63570, 91575, 97920, 119296, 127024, 152881, 155088, 193104, 203946, 240787, 253360, 296800, 289044, 362061, 378884, 437536, 456918
Offset: 1

Views

Author

Scott R. Shannon, May 30 2021

Keywords

Comments

For odd n, a(n) is given by the equation in the Formula section below. See also A344866. For even n no such equation is currently known, although one similar to the general formula for the number of polygons inside an n-gon, see A007678, likely exists.
The number of open regions, those outside the polygons with unbounded area and two edges that go to infinity, for n >= 3 is given by n*(n-1) = A002378(n-1).
See A345025 for the total number of all areas, both polygons and open regions.

Examples

			a(1) = a(2) = 0 as no polygon can be formed by one or two connected points.
a(3) = 1 as the connected vertices form a triangle, while the six regions outside the triangle are open.
a(4) = 4 as the four connected vertices form four triangles inside the square. Twelve open regions outside these polygons are also formed.
a(5) = 16 as the five connected vertices form eleven polygons inside the regular pentagon while also forming five triangles outside the pentagon, giving sixteen polygons in total. Twenty open regions outside these polygons are also formed.
a(6) = 42 as the six connected vertices form twenty-four polygons inside the regular hexagon while also forming eighteen polygons outside the hexagon, giving forty-two polygons in total. Thirty open regions outside these polygons are also formed.
See the linked images above for further examples.
		

Crossrefs

Cf. A344311 (number of finite regions outside the n-gon), A007678 (number inside the n-gon), A345025 (total number of regions), A344866 (number for odd n), A146212 (number of vertices), A344899 (number of edges), A344938 (number of k-gons), A002378 (number of open regions for (n-1)-gon).
Bisections: A344866, A347320.

Formula

For odd n, a(n) = (n^4 - 7*n^3 + 19*n^2 - 21*n + 8)/8 = (n-1)^2*(n^2-5*n+8)/8. This was conjectured by Scott R. Shannon and proved by Alexander Sidorenko on Sep 10 2021 (see link). - N. J. A. Sloane, Sep 12 2021
See also A344866.
a(n) = A344311(n) + A007678(n).

A358746 The number of vertices formed when every pair of n points, placed at the vertices of a regular n-gon, are connected by a circle and where the points lie at the ends of the circle's diameter.

Original entry on oeis.org

2, 6, 5, 55, 54, 252, 169, 747, 630, 1804, 1381, 3679, 3150, 6690, 5553, 11509, 9846, 18012, 15241, 27237, 24398, 39606, 33577, 56275, 50622, 77058, 69693, 102979, 94770, 135966, 124065, 175593, 162894, 222810, 205885, 279831, 260870, 347178, 321961, 424391, 399042
Offset: 2

Views

Author

Scott R. Shannon, Nov 30 2022

Keywords

Comments

Conjecture: for odd values of n all vertices are simple, other than those defining the diameters of the circles. No formula for n, or only the odd values of n, is currently known.
The author thanks Zach Shannon some of whose code was used in the generation of this sequence.
If n is odd, the circle containing the initial n points is not part of the graph (compare A370976-A370979). - N. J. A. Sloane, Mar 25 2024

Crossrefs

Cf. A358782 (regions), A358783 (edges), A359009 (k-gons), A007569, A146212.
See allso A370976-A370979.

Formula

a(n) = A358783(n) - A358782(n) + 1 by Euler's formula.

A344899 Number of polygon edges formed when every pair of vertices of a regular n-gon are joined by an infinite line.

Original entry on oeis.org

0, 1, 3, 8, 30, 78, 189, 320, 684, 1010, 1815, 2052, 3978, 4718, 7665, 8576, 13464, 12546, 22059, 23720, 34230, 36542, 50853, 47928, 72900, 76466, 101439, 105560, 137634, 115230, 182745, 188672, 238128, 245378, 305235, 294948, 385614, 395390, 480909, 491840, 592860, 544950, 723303, 737528
Offset: 1

Views

Author

Scott R. Shannon, Jun 02 2021

Keywords

Comments

See A344857 for other examples and images of the polygons.

Examples

			a(3) = 3 as the connected vertices form a triangle with three edges. Six infinite edges between the outer regions are also formed but these are not counted.
a(5) = 30 as the five connected vertices form a pentagon with fives lines along the pentagon's edges, fifteen lines inside forming eleven polygons, and ten lines outside forming another five triangles. In all these sixteen polygons form thirty edges. Twenty infinite edges between the outer regions are also formed.
		

Crossrefs

Cf. A344907 (number of edges for odd n), A344857 (number of polygons), A146212 (number of vertices), A344866, A344311, A007678, A331450, A344938.
Bisections: A344907, A347322.

Formula

Conjectured formula odd n: a(n) = (n^4 - 7*n^3 + 17*n^2 - 11*n)/4 = (n-1)*n*(n^2-6*n+11)/4.
This formula is correct: see the Sidorenko link. - N. J. A. Sloane, Sep 12 2021
See also A344907.
a(n) = A344857(n) + A146212(n) - 1 (Euler's theorem.).

A344866 Number of polygons formed when every pair of vertices of a regular (2n-1)-gon are joined by an infinite line.

Original entry on oeis.org

0, 1, 16, 99, 352, 925, 2016, 3871, 6784, 11097, 17200, 25531, 36576, 50869, 68992, 91575, 119296, 152881, 193104, 240787, 296800, 362061, 437536, 524239, 623232, 735625, 862576, 1005291, 1165024, 1343077, 1540800, 1759591, 2000896, 2266209, 2557072, 2875075, 3221856, 3599101, 4008544, 4451967
Offset: 1

Views

Author

Scott R. Shannon, Jun 01 2021

Keywords

Comments

This is the odd-indexed subsequence of A344857. See A344857 for images of the polygons.

Examples

			a(3) = 16 as the five connected vertices form eleven polygons inside the regular pentagon while also forming five triangles outside the pentagon, giving sixteen polygons in total.
		

Crossrefs

Cf. A344857 (number for even and odd n), A344311, A344938, A007678, A341735 (number inside the n-gon), A344899 (number of edges).
See also A347320.

Programs

  • Mathematica
    LinearRecurrence[{5,-10,10,-5,1},{0,1,16,99,352},40] (* Harvey P. Dale, Jun 01 2025 *)
  • Python
    def A344866(n): return n*(n*(n*(2*n - 11) + 23) - 21) + 7 # Chai Wah Wu, Sep 12 2021

Formula

a(n) = 2*n^4 - 11*n^3 + 23*n^2 - 21*n + 7.
G.f.: x^2*(1 + 11*x + 29*x^2 + 7*x^3)/(1 - x)^5. - Stefano Spezia, Jun 04 2021

Extensions

Edited by N. J. A. Sloane, Sep 12 2021

A344938 Irregular triangle read by rows: T(n,k) = number of k-sided polygons formed when every pair of vertices of a regular n-gon are joined by an infinite line, for k = 3, 4, ..., max_k.

Original entry on oeis.org

1, 4, 15, 0, 1, 36, 6, 70, 21, 7, 0, 1, 112, 64, 189, 108, 36, 18, 0, 0, 1, 270, 220, 50, 407, 352, 110, 55, 0, 0, 0, 0, 1, 624, 528, 884, 689, 325, 91, 0, 26, 0, 0, 0, 0, 1, 1162, 1092, 266, 14, 1530, 1545, 480, 270, 45, 0, 0, 0, 0, 0, 0, 0, 1, 2080, 2032, 416, 80
Offset: 3

Views

Author

Scott R. Shannon, Jun 03 2021

Keywords

Comments

See A344857 for examples and images of the polygons.

Examples

			A pentagon with all vertices connected forms 10 triangles inside the pentagon, 5 triangles outside the pentagon, giving 15 triangles in all, and 1 smaller pentagon inside the pentagon, so row 3 is [15,0,1].
The table begins:
1;
4;
15,0,1;
36,6;
70,21,7,0,1;
112,64;
189,108,36,18,0,0,1;
270,220,50;
407,352,110,55,0,0,0,0,1;
624,528;
884,689,325,91,0,26,0,0,0,0,1;
1162,1092,266,14;
1530,1545,480,270,45,0,0,0,0,0,0,0,1;
2080,2032,416,80;
2567,2754,1003,374,17,68,0,0,0,0,0,0,0,0,1;
3402,3366,180,18,18;
3952,4807,1672,475,95,76,0,19,0,0,0,0,0,0,0,0,1;
5380,5360,1580,240,0,20;
5943,7392,2583,1260,21,0,0,0,0,0,0,0,0,0,0,0,0,0,1;
7590,9020,2310,132,132,66;
9430,9775,4508,1518,253,46,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1;
11304,12288,2280,144;
13025,14650,6250,2375,200,75,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1;
16042,16952,5954,728,260,52;
17064,22464,7884,2700,567,189,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1;
21616,24192,7056,2016,168,28;
23751,29319,11281,3828,348,319,0,87,29,29,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1;
29880,29010,4140,540;
30814,39370,15314,5177,341,496,0,62,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1;
37440,42624,14240,3008,544,64;
41481,49335,19305,7854,891,363,66,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1;
		

Crossrefs

Cf. A344857 (total number of polygons), A344899 (number of edges), A146212 (number of vertices), A344866, A344311, A007678, A331450 (number of k-gons inside the regular n-gon).

Formula

Sum of row(n) = A344857(n) = A344311(n) + A007678(n).

A344657 Number of vertices formed by infinite lines when connecting all vertices and all points that divide the sides of an equilateral triangle into n equal parts.

Original entry on oeis.org

3, 10, 85, 310, 999, 2299, 4674, 8878, 14539, 23116, 35922, 53830, 74685, 106957, 140887, 183718, 240108, 315997, 392049, 497518, 599596, 730762, 888903, 1083277, 1257270, 1502830, 1760371, 2047792, 2362620, 2771437, 3129933, 3629443, 4107994, 4670305, 5245447, 5921755
Offset: 1

Views

Author

Scott R. Shannon, Jun 24 2021

Keywords

Comments

See A344279 for other images of the polygons.

Crossrefs

Cf. A344279 (number of polygons), A344896 (number of edges), A092867 (number polygons inside the triangle), A346446 (number of k-gons), A345649, A146212.

Formula

a(n) = A344896(n) - A344279(n) + 1.

A146213 Number of intersection points outside the n-gon of all lines through pairs of vertices of a regular n-gon.

Original entry on oeis.org

0, 0, 5, 18, 49, 88, 198, 300, 550, 588, 1235, 1414, 2415, 2576, 4284, 3708, 7068, 7280, 11025, 11330, 16445, 14592, 23650, 23972, 32994, 33208, 44863, 34830, 59675, 59808, 77880, 78064, 99960, 92844, 126429, 126426, 157833, 157560, 194750
Offset: 3

Views

Author

T. D. Noe, Oct 28 2008

Keywords

Comments

These are a subset of the points counted in A146212.
Note that n divides a(n). For odd n, it appears that a(n)=n(2n^3-15n^2+34n-21)/24. [Corrected by N. J. A. Sloane, Jun 11 2025. See next line.]
Theorem: For odd n >= 3, a(n) = n*(n-1)*(n-3)*(2*n-7)/24. Proof. We now know that for n odd >= 3, A146212(n) = n*(n^3-7*n^2+15*n-1)/8. Subtracting n + binomial(n,4) (see A007569), we get the stated formula. - N. J. A. Sloane, Jun 11 2025

Crossrefs

Formula

a(n) = A146212(n) - A007569(n).

Extensions

More terms from Jon E. Schoenfield, Nov 11 2008
Definition clarified by N. J. A. Sloane, Jun 11 2025

A345025 Number of regions formed when every pair of vertices of a regular n-gon are joined by an infinite line.

Original entry on oeis.org

1, 2, 7, 16, 36, 72, 141, 232, 424, 630, 1035, 1284, 2172, 2716, 4081, 4848, 7056, 7290, 11439, 12960, 17620, 19712, 26037, 26568, 37176, 40638, 51571, 55832, 69804, 64440, 92505, 98912, 120352, 128146, 154071, 156348, 194436, 205352, 242269, 254920, 298440, 290766, 363867, 380776, 439516
Offset: 1

Views

Author

Scott R. Shannon, Jun 06 2021

Keywords

Comments

The count of regions includes both the closed bounded polygons and the open unbounded areas surrounding these polygons with two edges that go to infinity.
See A344857 for further examples and images of the regions.

Examples

			a(2) = 2 as an infinite line connecting two points cuts space into two unbounded regions.
a(3) = 7 as the three connected points of the 3-gon form one closed triangle along with six outer unbounded areas, seven regions in total.
a(4) = 16 as the four connected points of the 4-gon form four closed triangle inside the square along with twelve outer unbounded areas, sixteen regions in total.
		

Crossrefs

Cf. A344857 (number of polygons), A344311 (number polygons outside the n-gon), A007678 (number polygons inside the n-gon), A002378 (number of open regions for (n-1)-gon), A146212 (number of vertices), A344866, A344938.

Formula

Formula for odd n: a(n) = (n^4 - 7*n^3 + 27*n^2 - 29*n + 8)/8 (see A344857).
For n >= 3, a(n) = A344857(n) + A002378(n-1).

A386559 Place a point on the integer coordinates, up to |n|, along all four axial directions on a Cartesian plane, and then join an infinite straight line between every pair of points: a(n) is the number of points where lines intersect in the resulting graph.

Original entry on oeis.org

5, 65, 381, 1213, 3033, 6105, 12285, 20789, 33705, 51065, 79797, 110817, 161549, 216985, 284269, 367925, 489953, 609225, 785045, 952877, 1157749, 1404473
Offset: 1

Views

Author

Scott R. Shannon, Jul 26 2025

Keywords

Comments

It appears that for n >= 3 the intersection that is furthest from the origin is formed by the crossing of the lines y = n/(n-1)*x + n and y = (n-1)/(n-2)*x - (n-1), along with the seven other symmetrically equivalent intersections. These intersections have a distance from the origin of approximately sqrt(8)*n^3 as n -> infinity.

Crossrefs

Cf. A386560 (regions), A386561 (edges), A386562 (k-gons), A146212, A347750, A344657, A345649.

Formula

a(n) = A386561(n) - A386560(n) + 1 by Euler's formula.
Showing 1-10 of 18 results. Next