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.

Previous Showing 41-50 of 98 results. Next

A290867 Irregular triangle read by rows: the number of points that are the intersections of k semicircles in the configuration A290447(n).

Original entry on oeis.org

0, 0, 0, 0, 1, 0, 5, 0, 15, 0, 35, 0, 70, 0, 123, 1, 0, 195, 5, 0, 285, 15, 0, 420, 25, 0, 586, 39, 2, 0, 818, 53, 4, 0, 1110, 73, 6, 0, 1451, 103, 10, 0, 1846, 142, 18, 0, 2361, 181, 26, 0, 2956, 234, 33, 2, 0, 3704, 287, 40, 4, 0, 4567, 348, 49, 8
Offset: 1

Views

Author

David Applegate, Aug 12 2017

Keywords

Comments

Row lengths are A290726(n).
The first entry of each row is 0, because an intersection requires at least 2 lines.
The first row with 3 entries is for n=9, because that is the first configuration with a nontrivial intersection.
Row sums give A290447.

Examples

			Triangle begins:
  0;
  0;
  0;
  0,   1;
  0,   5;
  0,  15;
  0,  35;
  0,  70;
  0, 123,   1;
  0, 195,   5;
  0, 285,  15;
  0, 420,  25;
  0, 586,  39,   2;
		

Crossrefs

Formula

Sum_{k} T(n,k) * binomial(k,2) = binomial(n,4), because there are binomial(n,4) total pairs of semicircles, and an intersection of k consists of binomial(k,2) of those pairs.
A290865(n) = binomial(n,2) + Sum_{k} T(n,k) * (k-1).

A329713 The number of regions inside a heptagon formed by the straight line segments mutually connecting all vertices and all points that divide the sides into n equal parts.

Original entry on oeis.org

50, 868, 5594, 18396, 48462, 101794, 195714, 336504, 549704, 841890, 1249676, 1774612, 2468572, 3328234, 4414054, 5725034, 7336855, 9233098, 11513419, 14149296, 17254434, 20805554, 24928380, 29573348, 34902155, 40861422, 47613161
Offset: 1

Views

Author

Keywords

Comments

The terms are from numeric computation - no formula for a(n) is currently known.

Crossrefs

Cf. A329714 (n-gons), A333112 (edges), A333113 (vertices), A007678, A092867, A331452, A331931.

Extensions

a(8)-a(27) from Lars Blomberg, May 13 2020

A331932 Triangle read by rows: Take a hexagon with all diagonals drawn, as in A331931. Then T(n,k) = number of k-sided polygons in that figure for k = 3, 4, ..., n+4.

Original entry on oeis.org

18, 6, 0, 264, 108, 36, 0, 1344, 654, 252, 12, 6, 4164, 2772, 1020, 228, 24, 0, 10038, 7758, 2424, 516, 72, 24, 0, 21108, 16188, 6060, 1128, 156, 0, 0, 0, 39690, 32022, 13368, 3654, 432, 48, 0, 0, 0, 68052, 56616, 22980, 6084, 888, 120, 12, 0, 0, 0
Offset: 1

Views

Author

Keywords

Comments

See the links in A331931 for images of the hexagons.

Examples

			A hexagon with no other points along its edges, n = 1, contains 18 triangles, 6 quadrilaterals and no other n-gons, so the first row is [18,6,0]. A hexagon with 1 point dividing its edges, n = 2, contains 264 triangles, 108 quadrilaterals, 36 pentagons and no other n-gons, so the second row is [264,108,36,0].
Triangle begins:
  18,6,0
  264,108,36,0
  1344,654,252,12,6
  4164,2772,1020,228,24,0
  10038,7758,2424,516,72,24,0
  21108,16188,6060,1128,156,0,0,0
  39690,32022,13368,3654,432,48,0,0,0
  68052,56616,22980,6084,888,120,12,0,0,0
The row sums are A331931.
		

Crossrefs

Cf. A331931 (regions), A330845 (edges), A330846 (vertices), A331906, A007678, A092867, A331452.

A332421 The number of regions inside a nonagon formed by the straight line segments mutually connecting all vertices and all points that divide the sides into n equal parts.

Original entry on oeis.org

154, 2754, 16858, 55098, 142318, 298350, 568162, 975294, 1585666, 2426292, 3588508, 5093604, 7067422, 9523746, 12612214, 16351218, 20924029, 26326026, 32789107, 40289238, 49093282, 59181228, 70852528
Offset: 1

Views

Author

Keywords

Comments

The terms are from numeric computation - no formula for a(n) is currently known.

Crossrefs

Cf. A332427 (n-gons), A332428 (vertices), A332429 (edges), A007678, A092867, A331452, A331929.

Extensions

a(6)-a(23) from Lars Blomberg, May 16 2020

A332606 Number of triangles in the graph formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares).

Original entry on oeis.org

14, 48, 102, 192, 326, 524, 802, 1192, 1634, 2296, 3074, 4052, 5246, 6740, 8398, 10440, 12770, 15512, 18782, 22384, 26386, 31204, 36482, 42232, 48826, 56508, 64318, 73356, 83366, 93996, 106010, 118788, 132634, 148600, 164814, 182648, 201998, 223172, 245634
Offset: 1

Views

Author

Keywords

Comments

See A331452 (the illustrations for T(n,2)) for pictures of these graphs.

Crossrefs

Extensions

a(21) and beyond from Lars Blomberg, Apr 28 2020

A332607 Number of quadrilaterals in the graph formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares).

Original entry on oeis.org

2, 8, 36, 92, 194, 336, 554, 812, 1314, 1756, 2508, 3252, 4348, 5464, 7054, 8760, 11050, 13324, 16162, 19256, 23188, 27120, 32098, 37396, 43456, 49516, 57608, 65440, 74670, 84388, 95674, 107656, 120990, 133996, 150144, 166424, 185090, 203960, 224926, 247120
Offset: 1

Views

Author

Keywords

Comments

See A331452 (the illustrations for T(n,2)) for pictures of these graphs.

Crossrefs

Extensions

a(21) and beyond from Lars Blomberg, Apr 28 2020

A333026 The number of vertices formed on an isosceles triangle by straight line segments mutually connecting all vertices and all points that divide the two equal length sides into n equal parts; the base of the triangle contains no points other than its vertices.

Original entry on oeis.org

3, 6, 16, 45, 111, 230, 448, 769, 1229, 1858, 2860, 4007, 5737, 7724, 10115, 13074, 17172, 21454, 27288, 33332, 40413, 48944, 59594, 70213, 82983, 97608, 113672, 131032, 152986, 174088, 201090, 228295, 258467, 292726, 328080, 365633, 412291, 460834, 512016
Offset: 1

Views

Author

Keywords

Comments

See the links in A332953 for images of the triangles.

Crossrefs

Cf. A332953 (regions), A333025 (n-gons), A333027 (edges), A007678, A092867, A331452, A331911, A332357, A332358.

Extensions

a(16) and beyond from Lars Blomberg, May 26 2020

A333139 The number of regions inside a decagon formed by the straight line segments mutually connecting all vertices and all points that divide the sides into n equal parts.

Original entry on oeis.org

220, 4220, 25220, 84280, 217800, 456640, 873090, 1501520, 2436020, 3736540, 5523970, 7830800, 10879460, 14665340, 19398660, 25173960, 32203320, 40502280, 50458120, 61995140, 75517160
Offset: 1

Views

Author

Keywords

Comments

The terms are from numeric computation - no formula for a(n) is currently known.

Crossrefs

Cf. A332417 (n-gons), A332418 (vertices), A332419 (edges), A007678, A092867, A331452, A331929.

Extensions

a(6)-a(21) from Lars Blomberg, May 18 2020

A333279 Column 2 of triangle in A288187.

Original entry on oeis.org

16, 56, 176, 388, 822, 1452, 2516, 3952, 6060, 8736, 12492, 17040, 23102, 30280, 39234, 49688, 62730, 77556, 95642, 115992, 139874, 166560, 197992, 232600, 272574, 316460, 366390, 420792, 482748, 549516, 624962, 706436, 796766, 893844, 1001074, 1115428
Offset: 1

Views

Author

Keywords

Comments

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.
The maximum number of edges over all chambers is 4 for 1 <= n <= 4 and 5 for 5 <= n <= 160. - Lars Blomberg, May 23 2021

Crossrefs

Extensions

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

A333280 Column 2 of triangle in A333278.

Original entry on oeis.org

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

Views

Author

Keywords

Comments

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.

Crossrefs

Extensions

a(10) and beyond from Lars Blomberg, May 23 2021
Previous Showing 41-50 of 98 results. Next