A333278 -id:A333278 - cp's OEIS frontend

A333280 Column 2 of triangle in A333278.

28, 92, 296, 652, 1408, 2470, 4312, 6774, 10428, 14992, 21492, 29328, 39876, 52184, 67616, 85588, 108192, 133674, 164992, 200158, 241560, 287428, 341768, 401472, 470764, 546230, 632404, 726170, 833420, 948550, 1079204, 1220054, 1376552, 1543742, 1729000

Offset: 1

Scott R. Shannon and N. J. A. Sloane, Mar 15 2020

nonn

For the graphs defined in A331452 and A288187 only the counts for graphs that are one square wide have formulas for regions, edges, and vertices (see A306302, A331757, A331755). For width 2 there are six such sequences (A331766, A331765, A331763; A333279, A333280, A333281). It would be nice to have a formula for any one of them.

See A333279 for illustrations.

Lars Blomberg, Table of n, a(n) for n = 1..200
Hugo Pfoertner, Illustrations of Chamber Complexes up to 5 X 5.

Cf. A331452, A288187; A331766, A331765, A331763; A333279, A333280, A333281.

a(10) and beyond from Lars Blomberg, May 23 2021

A330911 The number of edges formed by straight line segments mutually connecting all vertices of a semicircular polygon defined in A333642.

Original entry on oeis.org

5, 15, 35, 76, 142, 251, 408, 576, 947, 1367, 1845, 2600, 3460, 4011, 5822, 7386, 9023, 11423, 13967, 16242, 20330, 24235, 28222, 33686, 39327, 44967, 52733, 60608, 67383, 78947, 89530, 100040, 113885, 127791, 141925, 159356, 177158, 194895, 217232, 239662

Offset: 1

Scott R. Shannon and N. J. A. Sloane, May 02 2020

nonn

See A333642 for a precise definition of the polygon and images.

Lars Blomberg, Table of n, a(n) for n = 1..100

Cf. A333642 (regions), A330913 (vertices), A330914 (n-gons), A333278, A333027, A135565.

a(21) and beyond from Lars Blomberg, May 03 2020

A333283 Triangle read by rows: T(m,n) (m >= n >= 1) = number of edges formed by drawing the line segments connecting any two of the (m+1) X (n+1) lattice points in an m X n grid of squares and extending them to the boundary of the grid.

Original entry on oeis.org

8, 28, 92, 80, 320, 1028, 178, 716, 2348, 5512, 372, 1604, 5332, 12676, 28552, 654, 2834, 9404, 22238, 49928, 87540, 1124, 5008, 16696, 39496, 88540, 156504, 279100, 1782, 7874, 26458, 62818, 141386, 251136, 447870

Offset: 1

Scott R. Shannon and N. J. A. Sloane, Mar 16 2020

If we only joined pairs of the 2(m+n) boundary points, we would get A331454. If we did not extend the lines to the boundary of the grid, we would get A333278. (One of the links below shows the difference between the three definitions in the case m=3, n=2.)

See A333282 for a large number of colored illustrations.

			Triangle begins:
8,
28, 92,
80, 320, 1028,
178, 716, 2348, 5512,
372, 1604, 5332, 12676, 28552,
654, 2834, 9404, 22238, 49928, 87540,
1124, 5008, 16696, 39496, 88540, 156504, 279100,
1782, 7874, 26458, 62818, 141386, 251136, 447870, ...
...
T(7,7) corrected Mar 19 2020

Seppo Mustonen, Statistical accuracy of geometric constructions, 2008.
Seppo Mustonen, Statistical accuracy of geometric constructions, 2008 [Local copy]
Seppo Mustonen, On lines and their intersection points in a rectangular grid of points, 2009
Seppo Mustonen, On lines and their intersection points in a rectangular grid of points, 2009 [Local copy]
Seppo Mustonen, On lines going through a given number of points in a rectangular grid of points, 2010
Seppo Mustonen, On lines going through a given number of points in a rectangular grid of points, 2010 [Local copy]
N. J. A. Sloane, Illustration of T(3,2) = 320. [Black lines correspond to A331454(3,2), black + red lines correspond to A333278(3,2), and black + red + blue lines to T(3,2)]
N. J. A. Sloane, Illustration of T(3,3) = 1028 [Black lines correspond to A288187(3,3), and black + red lines to T(3,3)]

Cf. A288187, A331452, A333278, A331454, A333282 (regions), A333284 (vertices). Column 1 is A331757.

More terms and corrections from Scott R. Shannon, Mar 21 2020

cp's OEIS Frontend

A333280 Column 2 of triangle in A333278.

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions

A330911 The number of edges formed by straight line segments mutually connecting all vertices of a semicircular polygon defined in A333642.

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions

A333283 Triangle read by rows: T(m,n) (m >= n >= 1) = number of edges formed by drawing the line segments connecting any two of the (m+1) X (n+1) lattice points in an m X n grid of squares and extending them to the boundary of the grid.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Extensions