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 71-80 of 144 results. Next

A335646 Irregular table read by rows: row n gives the number of 5-gon to k-gon contacts, with k>=5, for a regular n-gon with all diagonals drawn.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 11, 0, 39, 42, 15, 0, 15, 0, 102, 18, 190, 38, 19, 20, 80, 273, 210, 21, 154, 44, 529, 322, 69, 144, 750, 350, 598, 156, 26, 1215, 432, 81, 560, 56, 928, 406, 29, 0, 0, 0, 29, 300, 60, 2139, 248, 93, 1568, 704, 64, 1782, 792, 132
Offset: 3

Views

Author

Scott R. Shannon, Aug 23 2020

Keywords

Comments

See A333654 for the number of 3-gon to k-gon contacts, with k>=3.
See A335614 for the number of 4-gon to k-gon contacts, with k>=4.
See A337330 for the number of 6-gon to k-gon contacts, with k>=6.
See A007678 for the number of regions and images of other n-gons.

Examples

			The table begins:
.
0;
0;
0;
0;
0;
0;
0;
0;
11;
0;
39;
42;
15,0,15;
0;
102;
18;
190,38,19;
20,80;
273,210,21;
154,44;
529,322,69;
144;
750,350;
598,156,26;
1215,432,81;
560,56;
928,406,29,0,0,0,29;
300,60;
2139,248,93;
1568,704,64;
1782,792,132;
		

Crossrefs

Cf. A333654 (3-gon contacts), A335614 (4-gon contacts), A337330 (6-gon contacts), A007678, A135565, A007569, A062361, A331450, A331451.

A337330 Irregular table read by rows: row n gives the number of 6-gon to k-gon contacts, with k>=6, for a regular n-gon with all diagonals drawn, with n>=25.

Original entry on oeis.org

50, 0, 108, 0, 0, 0, 124, 32, 66, 136, 70, 144, 148, 76, 390, 120, 328, 82, 42, 86, 86, 0, 540, 92, 92, 188, 94, 94, 0, 196, 98, 750, 100, 816, 416, 104, 1272, 432, 220, 110, 728, 570, 570, 406, 348, 116, 1062, 354, 300, 854, 366, 122, 1488, 124, 1512, 252, 126, 576, 2080, 130, 260, 2112
Offset: 25

Views

Author

Scott R. Shannon, Aug 23 2020

Keywords

Comments

For n=3 to n=24 there are no n-gons that have 6-gon to k-gon contacts, where k>=6, so the table starts at n=25.
See A333654 for the number of 3-gon to k-gon contacts, with k>=3.
See A335614 for the number of 4-gon to k-gon contacts, with k>=4.
See A335646 for the number of 5-gon to k-gon contacts, with k>=5.
See A007678 for the number of regions and images of other n-gons.

Examples

			The table begins:
.
50;
0;
108;
0;
0;
0;
124;
32;
66;
136;
70;
144;
148;
76;
390;
120;
328, 82;
42;
		

Crossrefs

Cf. A333654 (3-gon contacts), A335614 (4-gon contacts), A335646 (5-gon contacts), A007678, A135565, A007569, A062361, A331450, A331451.

Extensions

a(34) and beyond from Scott R. Shannon, Jan 11 2021

A340639 The number of regions inside a Reuleaux triangle 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

1, 24, 145, 516, 1432, 3084, 6106, 10638, 17764, 27336, 41233, 58902, 82675, 111864, 149497, 194430, 250534, 316020, 395728, 487122, 596434, 720162, 865321, 1027974, 1216291, 1425348, 1664539, 1928022, 2226658, 2553204, 2920378, 3319536, 3764848, 4246638, 4780489, 5355414, 5988973
Offset: 1

Views

Author

Keywords

Comments

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

Crossrefs

Cf. A340644 (vertices), A340613 (edges), A340614 (n-gons), A007678, A092867.

A340644 The number of vertices on a Reuleaux triangle 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

3, 19, 120, 442, 1332, 2863, 5871, 10171, 17358, 26518, 40590, 57757, 81735, 110209, 148158, 192184, 248772, 313105, 393429, 483283, 593490, 715528, 861660, 1022281, 1211811, 1418515, 1659108, 1919842, 2220204, 2543527, 2912751, 3308305, 3755922, 4233730, 4770150, 5340529, 5977071
Offset: 1

Views

Author

Keywords

Comments

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

Crossrefs

Cf. A340639 (regions), A340613 (edges), A340614 (n-gons), A007678, A092867.

A342236 a(n) is the smallest m such that a regular m-gon with all diagonals drawn contains a cell with n sides, as in A342222, but for odd m the central m-sided polygon is not considered. Otherwise a(n) = -1 if no such m exists.

Original entry on oeis.org

4, 6, 7, 9, 15, 13, 35, 29, 29, 40, 93, 43, 399, 212
Offset: 3

Views

Author

Keywords

Comments

An m-gon with an odd number of sides contains a central cell with m sides by its construction, and it will be the m-gon with the fewest possible sides to do so. See A342222 for a proof. This sequence lists the smallest m-sided polygon to contain an n-sided cell where this central cell is not considered for odd m.
See A342222 for other images of the m-sided polygons.
a(17) is presently unknown, but if a(17) > 0 it is greater than 765.

Crossrefs

See also A341729 and A341730 for the maximum number of sides in any cell.

Extensions

a(15)-a(16) added by Scott R. Shannon, Mar 15 2021
Minimum value for a(17) updated by Scott R. Shannon, Mar 21 2021
Minimum value for a(17) updated by Scott R. Shannon, Nov 30 2021

A329714 Irregular table read by rows: Take a heptagon with all diagonals drawn, as in A329713. Then T(n,k) = number of k-sided polygons in that figure for k >= 3.

Original entry on oeis.org

35, 7, 7, 0, 1, 504, 224, 112, 28, 2331, 1883, 1008, 273, 92, 7, 7658, 6314, 3416, 798, 182, 28, 18662, 17514, 8463, 2898, 714, 175, 28, 7, 0, 0, 0, 1, 40404, 35462, 18508, 5796, 1330, 266, 28
Offset: 1

Views

Author

Keywords

Comments

See the links in A329713 for images of the heptagons.

Examples

			A heptagon with no other points along its edges, n = 1, contains 35 triangles, 7 quadrilaterals, 7 pentagons, 1 heptagon and no other n-gons, so the first row is [35,7,7,0,1]. A heptagon with 1 point dividing its edges, n = 2, contains 504 triangles, 224 quadrilaterals, 112 pentagons, 28 hexagons and no other n-gons, so the second row is [504,224,112,28].
Triangle begins:
35, 7, 7, 0, 1;
504, 224, 112, 28;
2331, 1883, 1008, 273, 92, 7;
7658, 6314, 3416, 798, 182, 28;
18662, 17514, 8463, 2898, 714, 175, 28, 7, 0, 0, 0, 1;
40404, 35462, 18508, 5796, 1330, 266, 28;
73248, 71596, 35777, 11669, 2654, 651, 70, 49;
The row sums are A329713.
		

Crossrefs

Cf. A329713 (regions), A333112 (edges), A333113 (vertices), A331906, A007678, A092867, A331452.

A331455 Number of regions in a "cross" of width 3 and height n (see Comments for definition).

Original entry on oeis.org

64, 104, 176, 304, 492, 778, 1176, 1732, 2446, 3416, 4614, 6172, 8060, 10340, 13052, 16388, 20228, 24852, 30134, 36206, 43076, 51092, 60010, 70186, 81498, 94180, 108140, 123938, 141074, 160308, 181320, 204328, 229288, 256574, 285856, 318124, 352838, 390338
Offset: 2

Views

Author

Keywords

Comments

This "cross" of height n consists of a vertical column of n >= 2 squares with two additional squares extending to the left and right of the second square. (See illustrations.)
There are n+2 squares in all. The number of vertices is 3*n+2.
Now join every pair of vertices by a line segment, provided the line does not extend beyond the boundary of the cross. The sequence gives the number of regions in the resulting figure.

Crossrefs

Cf. A330848 (n-gons), A330850 (vertices), A330851 (edges).
See A331456 for crosses in which the arms have equal length.
A331452 is a similar sequence for a rectangular region; A007678 for a polygonal region.

Extensions

a(11) and beyond from Lars Blomberg, May 31 2020

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

Original entry on oeis.org

40, 0, 0, 590, 420, 80, 10, 2890, 3030, 1130, 230, 50, 9540, 10530, 4290, 980, 190, 10, 22730, 28390, 10960, 3200, 550, 80, 20, 47610, 57450, 23270, 6530, 1160, 160, 20, 0, 90080, 109160, 47430, 13430, 2460, 410, 40, 0, 0, 154840, 193480, 82330, 22410, 4620
Offset: 1

Views

Author

Keywords

Comments

See the links in A331906 for images of the pentagrams.

Examples

			A pentagram with no other points along its edges, n = 1, contains 40 triangles and no other n-gons, so the first row is [40,0,0]. A pentagram with 1 point dividing its edges, n = 2, contains 590 triangles, 420 quadrilaterals, 80 pentagons and 10 hexagons, so the second row is [590,420,80,10].
Triangle begins:
40,0,0
590, 420, 80, 10
2890, 3030, 1130, 230, 50
9540, 10530, 4290, 980, 190, 10
22730, 28390, 10960, 3200, 550, 80, 20
47610, 57450, 23270, 6530, 1160, 160, 20, 0
The row sums are A331906.
		

Crossrefs

Cf. A331906 (regions), A333117 (vertices), A333118 (edges), A007678, A092867, A331452.

Extensions

a(34) and beyond from Lars Blomberg, May 06 2020

A331908 The number of regions inside a hexagram 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

168, 3588, 20424, 73860, 189468, 402216, 782808, 1385040, 2214108, 3423840, 5196312, 7218552, 10353432, 13823772, 18047124, 24083736, 31051152, 38334972, 48877440, 59201544, 72052956, 88004184, 106601088, 124009020
Offset: 1

Views

Author

Keywords

Comments

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

Crossrefs

Cf. A331909 (n-gons), A333116 (vertices), A333049 (edges), A007678, A092867, A331452, A331906.

Extensions

a(6)-a(24) from Lars Blomberg, May 10 2020

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

Original entry on oeis.org

132, 36, 0, 0, 2052, 1188, 324, 24, 0, 10440, 7956, 1728, 300, 0, 0, 33672, 28812, 9276, 1836, 228, 24, 12, 83040, 75276, 24948, 5436, 708, 60, 0, 0, 172140, 162060, 54732, 11280, 1836, 168, 0, 0, 0, 322284, 315492, 114624, 25980, 3948, 456, 24, 0, 0, 0
Offset: 1

Views

Author

Keywords

Comments

See the links in A331908 for images of the hexagrams.

Examples

			A hexagram with no other points along its edges, n = 1, contains 132 triangles, 36 quadrilaterals and no other n-gons, so the first row is [132,36,0,0]. A hexagram with 1 point dividing its edges, n = 2, contains 2052 triangles, 1188 quadrilaterals, 324 pentagons, 24 hexagons and no other n-gons, so the second row is [2052,1188,324,24,0].
Triangle begins:
  132, 36, 0, 0
  2052, 1188, 324, 24, 0
  10440, 7956, 1728, 300, 0, 0
  33672, 28812, 9276, 1836, 228, 24, 12
  83040, 75276, 24948, 5436, 708, 60, 0, 0
The row sums are A331908.
		

Crossrefs

Cf. A331908 (regions), A333116 (vertices), A333049 (edges), A007678, A092867, A331452, A331906.

Extensions

a(31) and beyond from Lars Blomberg, May 10 2020
Previous Showing 71-80 of 144 results. Next