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-4 of 4 results.

A345459 Number of polygons formed when connecting all 4n points on the perimeter of an n X n square by infinite lines.

Original entry on oeis.org

0, 4, 80, 568, 2024, 6052, 12144, 26976, 45024, 76724, 116840, 191128, 245976, 388452, 501888, 661476, 870168, 1199724, 1402096, 1911384, 2188320, 2739280, 3371264, 4224288, 4617224, 5801372, 6780568
Offset: 0

Views

Author

Keywords

Comments

The width/height of the entire figure grows as ~ 2*n^3 for large n. See the Formula section below.

Examples

			a(2) = 80. Connecting the 8 perimeter points results in the creation of forty-eight 3-gons and eight 4-gons inside the square while creating twenty-four 3-gons outside the square, giving eighty polygons in total. See the linked images.
		

Crossrefs

Cf. A255011 (number inside the square), A345648 (number outside the square), A345649 (number of vertices), A345650 (number of edges), A344993, A344857, A092098, A007678.

Formula

a(n) = A345650(n) - A345649(n) + 1.
Assuming the square is of size n x n centered on the origin the x (or y) offset for the eight outermost vertices is n^3 - 2*n^2 + 3*n/2, which have a corresponding y (or x) offset of n^2 - 3*n/2 + 1. The total distance from the origin of these vertices is sqrt(n^6 - 4*n^5 + 8*n^4 - 9*n^3 + 13*n^2/2 - 3*n + 1).

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.

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.

A345650 Number of polygon edges formed when connecting all 4n points on the perimeter of an n X n square by infinite lines.

Original entry on oeis.org

0, 8, 140, 1032, 3608, 11308, 21892, 51000, 83404, 143900, 217728, 367132, 456008, 749328, 952236, 1251056, 1649708, 2327232, 2653900, 3717444, 4158448, 5243680, 6488208, 8241988, 8780976, 11235028, 13116156
Offset: 0

Views

Author

Keywords

Comments

See A345459 for images of the polygons.

Crossrefs

Cf. A331448 (number inside the square), A345459 (number of polygons), A345649 (number of vertices), A255011, A345648, A344993, A344857, A092098, A007678.

Formula

a(n) = A345459(n) + A345649(n) - 1.
Showing 1-4 of 4 results.