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

A352866 Irregular table read by rows: T(n,k) is the number of regions formed after k diagonals, with k>=0, are drawn between vertices of a regular n-gon, with n>=3, when each vertex in turn is connected to the vertex two to its left, then three to its left, then four... until all vertices are connected by diagonals.

Original entry on oeis.org

1, 1, 2, 4, 1, 2, 4, 6, 8, 11, 1, 2, 4, 6, 8, 10, 13, 16, 20, 24, 1, 2, 4, 6, 8, 10, 12, 15, 18, 22, 27, 32, 37, 43, 50, 1, 2, 4, 6, 8, 10, 12, 14, 17, 20, 24, 29, 34, 39, 44, 50, 57, 62, 68, 74, 80, 1, 2, 4, 6, 8, 10, 12, 14, 16, 19, 22, 26, 31, 36, 41, 46, 51, 57, 64, 71, 79, 88, 98, 108, 118, 129, 141, 154
Offset: 3

Views

Author

Scott R. Shannon, Apr 06 2022

Keywords

Comments

To create the diagonals between the vertices of the regular n-gon a random starting vertex is first chosen. This vertex is then connected to the vertex two to its left. The left neighboring vertex of the starting vertex is then chosen and this is connected to the vertex two to its left. This process is continued until all vertices are connected by diagonals to the vertices two to their left. The initial vertex is then chosen again and it is connected to the vertex three to its left. Its left neighboring vertex is then connected to the vertex three to its left, and so on. This process of connecting all vertices to those on their left by diagonals, where the step size increases by one after each complete circuit of the n-gon, is continued until all vertices are connected by diagonals. The sequence gives the number of regions inside the n-gon after each such diagonal is drawn.

Examples

			The table begins:
1;
1,2,4;
1,2,4,6,8,11;
1,2,4,6,8,10,13,16,20,24;
1,2,4,6,8,10,12,15,18,22,27,32,37,43,50;
1,2,4,6,8,10,12,14,17,20,24,29,34,39,44,50,57,62,68,74,80;
1,2,4,6,8,10,12,14,16,19,22,26,31,36,41,46,51,57,64,71,79,88,98,108,118,129, \
        141,154;
1,2,4,6,8,10,12,14,16,18,21,24,28,33,38,43,48,53,58,64,71,78,86,95,105,115, \
        125,135,146,158,171,180,190,200,210,220;
1,2,4,6,8,10,12,14,16,18,20,23,26,30,35,40,45,50,55,60,65,71,78,85,93,102,112, \
        122,132,142,152,163,175,188,201,215,230,246,263,280,297,315,334,354,375;
.
.
See the linked file for the table up to n=100. See the linked images for examples of the 10-gon.

Links

Crossrefs

Cf. A352533, A007678, A350000, A344857.

Formula

The last term in each row n = A007678(n).

A352883 Irregular table read by rows: T(n,k) is the number of regions formed after k diagonals, with k>=0, are drawn between vertices of a regular n-gon, with n>=3, when each vertex in turn is connected to the vertex floor(n/2) vertices to its left, then floor(n/2)-1 vertices to its left, then floor(n/2)-2 vertices ... until all vertices are connected by diagonals.

Original entry on oeis.org

1, 1, 2, 4, 1, 2, 4, 6, 8, 11, 1, 2, 4, 6, 8, 11, 14, 17, 20, 24, 1, 2, 4, 7, 10, 13, 17, 22, 25, 29, 33, 37, 41, 45, 50, 1, 2, 4, 6, 8, 11, 14, 18, 22, 26, 30, 35, 40, 44, 49, 54, 59, 64, 69, 74, 80, 1, 2, 4, 7, 11, 15, 19, 24, 30, 37, 42, 48, 55, 62, 69, 76, 83, 91, 100, 105, 111, 117, 123, 129, 135, 141, 147, 154
Offset: 3

Views

Author

Scott R. Shannon, Apr 07 2022

Keywords

Comments

To create the diagonals between the vertices of the regular n-gon a random starting vertex is first chosen. This vertex is then connected to the vertex floor(n/2) vertices to its left. The left neighboring vertex of the starting vertex is then chosen and this is connected to the vertex floor(n/2) to its left. This process is continued until all vertices are connected by diagonals to the vertices floor(n/2) to their left. Note that when n is even only n/2 diagonals are drawn in this phase as further diagonals would just retrace the previous diagonal connections. The initial vertex is then chosen again and it is connected to the vertex floor(n/2)-1 to its left. Its left neighboring vertex is then connected to the vertex floor(n/2)-1 to its left, and so on. This process of connecting all vertices to those on their left by diagonals, where the step size decreases by one after each complete circuit of the n-gon until the step size is 2, is continued until all vertices are connected by diagonals. The sequence gives the number of regions inside the n-gon after each such diagonal is drawn.

Examples

			The table begins:
1;
1,2,4;
1,2,4,6,8,11;
1,2,4,6,8,11,14,17,20,24;
1,2,4,7,10,13,17,22,25,29,33,37,41,45,50;
1,2,4,6,8,11,14,18,22,26,30,35,40,44,49,54,59,64,69,74,80;
1,2,4,7,11,15,19,24,30,37,42,48,55,62,69,76,83,91,100,105,111,117,123,129,135, \
  141,147,154;
1,2,4,6,8,10,14,19,24,30,36,42,48,55,62,70,77,84,92,100,108,116,124,132,141,150, \
  156,163,170,177,184,191,198,205,212,220;
1,2,4,7,11,16,21,26,32,39,47,56,63,71,80,90,100,110,120,130,141,153,166,175,185, \
  196,207,218,229,240,251,262,274,287,294,302,310,318,326,334,342,350,358,366,375;
.
.
See the linked file for the table up to n=100. See the linked images for examples of the 11-gon.

Links

Crossrefs

Cf. A352866, A352533, A007678, A350000, A344857.

Formula

The last term in each row n = A007678(n).
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.