A357216 -id:A357216 - cp's OEIS frontend

A357235 Table read by antidiagonals: T(n,k) (n >= 3, k >= 0) is the number of vertices in an n-gon when k internal n-gons are drawn between the n*k points that divide each side into k+1 equal parts.

3, 6, 4, 15, 8, 5, 30, 20, 10, 6, 51, 40, 25, 12, 7, 66, 68, 50, 30, 14, 8, 111, 88, 85, 60, 35, 16, 9, 150, 148, 130, 102, 70, 40, 18, 10, 171, 168, 185, 156, 119, 80, 45, 20, 11, 246, 260, 250, 222, 182, 136, 90, 50, 22, 12, 303, 296, 325, 300, 259, 208, 153, 100, 55, 24, 13

Offset: 3

Scott R. Shannon, Sep 19 2022

Conjecture: the only n-gons that contain non-simple intersections are the 3-gon (triangle), 4-gon (square), and 6-gon (hexagon).

			The table begins:
   3,  6, 15,  30,  51,  66, 111, 150, 171,  246,  303,  312,  435,  510,  543, ...
   4,  8, 20,  40,  68,  88, 148, 168, 260,  296,  404,  436,  580,  632,  788, ...
   5, 10, 25,  50,  85, 130, 185, 250, 325,  410,  505,  610,  725,  850,  985, ...
   6, 12, 30,  60, 102, 156, 222, 300, 390,  468,  606,  708,  870, 1020, 1152, ...
   7, 14, 35,  70, 119, 182, 259, 350, 455,  574,  707,  854, 1015, 1190, 1379, ...
   8, 16, 40,  80, 136, 208, 296, 400, 520,  656,  808,  976, 1160, 1360, 1576, ...
   9, 18, 45,  90, 153, 234, 333, 450, 585,  738,  909, 1098, 1305, 1530, 1773, ...
  10, 20, 50, 100, 170, 260, 370, 500, 650,  820, 1010, 1220, 1450, 1700, 1970, ...
  11, 22, 55, 110, 187, 286, 407, 550, 715,  902, 1111, 1342, 1595, 1870, 2167, ...
  12, 24, 60, 120, 204, 312, 444, 600, 780,  984, 1212, 1464, 1740, 2040, 2364, ...
  13, 26, 65, 130, 221, 338, 481, 650, 845, 1066, 1313, 1586, 1885, 2210, 2561, ...
  14, 28, 70, 140, 238, 364, 518, 700, 910, 1148, 1414, 1708, 2030, 2380, 2758, ...
  15, 30, 75, 150, 255, 390, 555, 750, 975, 1230, 1515, 1830, 2175, 2550, 2955, ...
See the attached text file for further examples.
See A357007, A357060, A357197 for more images of the n-gons.

Scott R. Shannon, Extended table for n = 3..50, k = 0..75.
Scott R. Shannon, Image of T(5,20) = 2005.
Scott R. Shannon, Image of T(7,10) = 707.

Cf. A357216 (regions), A357254 (edges), A357007 (triangle), A357060 (square), A357197 (hexagon), A007569, A146212.

T(n,k) = A357254(n,k) - A357216(n,k) + 1 by Euler's formula.
T(n,0) = n.
T(n,1) = 2n.
Conjectured formula for all columns for n >= 7: T(n,k) = n*k^2 + n.
T(3,k) = A357007(k).
T(4,k) = A357060(k).
T(6,k) = A357197(k).
Conjectured formula for all rows except for n = 3, 4, 6: T(n,k) = n*k^2 + n.

A357254 Table read by antidiagonals: T(n,k) (n >= 3, k >= 0) is the number of edges in an n-gon when k internal n-gons are drawn between the n*k points that divide each side into k+1 equal parts.

Original entry on oeis.org

3, 9, 4, 27, 12, 5, 57, 36, 15, 6, 99, 76, 45, 18, 7, 135, 132, 95, 54, 21, 8, 219, 180, 165, 114, 63, 24, 9, 297, 292, 255, 198, 133, 72, 27, 10, 351, 348, 365, 306, 231, 152, 81, 30, 11, 489, 516, 495, 438, 357, 264, 171, 90, 33, 12, 603, 604, 645, 594, 511, 408, 297, 190, 99, 36, 13

Offset: 3

Scott R. Shannon, Sep 20 2022

Conjecture: the only n-gons that contain non-simple intersections are the 3-gon (triangle), 4-gon (square), and 6-gon (hexagon).

			The table begins:
   3,  9,  27,  57,  99, 135,  219,  297,  351,  489,  603,  645,  867, 1017, ...
   4, 12,  36,  76, 132, 180,  292,  348,  516,  604,  804,  892, 1156, 1284, ...
   5, 15,  45,  95, 165, 255,  365,  495,  645,  815, 1005, 1215, 1445, 1695, ...
   6, 18,  54, 114, 198, 306,  438,  594,  774,  942, 1206, 1422, 1734, 2034, ...
   7, 21,  63, 133, 231, 357,  511,  693,  903, 1141, 1407, 1701, 2023, 2373, ...
   8, 24,  72, 152, 264, 408,  584,  792, 1032, 1304, 1608, 1944, 2312, 2712, ...
   9, 27,  81, 171, 297, 459,  657,  891, 1161, 1467, 1809, 2187, 2601, 3051, ...
  10, 30,  90, 190, 330, 510,  730,  990, 1290, 1630, 2010, 2430, 2890, 3390, ...
  11, 33,  99, 209, 363, 561,  803, 1089, 1419, 1793, 2211, 2673, 3179, 3729, ...
  12, 36, 108, 228, 396, 612,  876, 1188, 1548, 1956, 2412, 2916, 3468, 4068, ...
  13, 39, 117, 247, 429, 663,  949, 1287, 1677, 2119, 2613, 3159, 3757, 4407, ...
  14, 42, 126, 266, 462, 714, 1022, 1386, 1806, 2282, 2814, 3402, 4046, 4746, ...
  15, 45, 135, 285, 495, 765, 1095, 1485, 1935, 2445, 3015, 3645, 4335, 5085, ...
  ...
See the attached text file for further examples.
See A356984, A357058, A357196 for images of the n-gons.

Scott R. Shannon, Extended table for n = 3..50, k = 0..75.

Cf. A357216 (regions), A357235 (vertices), A357008 (triangle), A357061 (square), A357198 (hexagon), A356984, A357058, A357196, A135565, A344899.

T(n,k) = A357216(n,k) + A357235(n,k) - 1 by Euler's formula.
T(n,0) = n.
T(n,1) = 3n.
Conjectured formula for all columns for n >= 7: T(n,k) = 2n*k^2 + n.
T(3,k) = A357008(k).
T(4,k) = A357061(k).
T(6,k) = A357198(k).
Conjectured formula for all rows except for n = 3, 4, 6: T(n,k) = 2n*k^2 + n.

cp's OEIS Frontend

A357235 Table read by antidiagonals: T(n,k) (n >= 3, k >= 0) is the number of vertices in an n-gon when k internal n-gons are drawn between the n*k points that divide each side into k+1 equal parts.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula