A335192 -id:A335192 - cp's OEIS frontend

A335350 a(n) is the number of regions formed in a square by dividing each of its sides into n equal parts giving a total of 4n nodes and drawing straight line segments from node k to node (k+n+1) mod 4n, 0 <= k < 4*n.

4, 25, 37, 81, 109, 169, 205, 289, 341, 441, 485, 625, 701, 825, 913, 1089, 1189, 1369, 1461, 1661, 1805, 2025, 2141, 2389, 2549, 2809, 2929, 3249, 3405, 3721, 3901, 4205, 4421, 4753, 4913, 5329, 5549, 5913, 6105, 6561, 6781, 7225, 7453, 7885, 8189, 8649

Offset: 1

Lars Blomberg, Jun 03 2020

nonn

For n>1, a(n)-1 is divisible by 4.

Lars Blomberg, Table of n, a(n) for n = 1..500
Lars Blomberg, Illustration for n=3
Lars Blomberg, Illustration for n=4
Lars Blomberg, Illustration for n=5
Lars Blomberg, Illustration for n=10
Lars Blomberg, Illustration for n=16
Lars Blomberg, Illustration for n=35

Cf. A335351 (edges), A335352 (vertices), A335353 (n-gons), A335354 (edges in central polygon), A255011, A335057, A335192.

A335351 a(n) is the number of edges formed in a square by dividing each of its sides into n equal parts giving a total of 4n nodes and drawing straight line segments from node k to node (k+n+1) mod 4n, 0 <= k < 4*n.

Original entry on oeis.org

8, 48, 64, 160, 208, 336, 392, 576, 664, 880, 936, 1248, 1376, 1632, 1784, 2176, 2344, 2736, 2872, 3304, 3568, 4048, 4224, 4768, 5048, 5616, 5776, 6496, 6744, 7440, 7736, 8392, 8776, 9496, 9712, 10656, 11024, 11808, 12088, 13120, 13464, 14448, 14800, 15736

Offset: 1

Lars Blomberg, Jun 04 2020

nonn

For n>1, a(n) is divisible by 8.

See A335350 for illustrations.

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

Cf. A335350 (regions), A335352 (vertices), A335353 (n-gons), A335354 (edges in central polygon), A255011, A335057, A335192.

A335352 a(n) is the number of vertices formed in a square by dividing each of its sides into n equal parts giving a total of 4n nodes and drawing straight line segments from node k to node (k+n+1) mod 4n, 0 <= k < 4*n.

Original entry on oeis.org

5, 24, 28, 80, 100, 168, 188, 288, 324, 440, 452, 624, 676, 808, 872, 1088, 1156, 1368, 1412, 1644, 1764, 2024, 2084, 2380, 2500, 2808, 2848, 3248, 3340, 3720, 3836, 4188, 4356, 4744, 4800, 5328, 5476, 5896, 5984, 6560, 6684, 7224, 7348, 7852, 8100, 8648

Offset: 1

Lars Blomberg, Jun 04 2020

nonn

For n>1, a(n) is divisible by 4.

See A335350 for illustrations.

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

Cf. A335350 (regions), A335351 (edges), A335353 (n-gons), A335354 (edges in central polygon), A255011, A335057, A335192.

A335353 Irregular table read by rows: Take a square and divide each of its sides into n equal parts giving a total of 4n nodes, draw straight line segments from node k to node (k+n+1) mod 4n, 0 <= k < 4*n. Then T(n,k) = number of k-sided polygons in that figure for k >= 3.

Original entry on oeis.org

4, 16, 8, 0, 0, 0, 1, 32, 5, 32, 40, 8, 0, 0, 1, 64, 28, 16, 0, 0, 0, 0, 0, 0, 1, 80, 56, 24, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 96, 84, 24, 0, 0, 0, 0, 0, 0, 1, 128, 100, 40, 20, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 144, 156, 32, 0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1

Offset: 1

Lars Blomberg, Jun 04 2020

See A335350 for illustrations.

			Table begins:
4;
16, 8, 0, 0, 0, 1;
32, 5;
32, 40, 8, 0, 0, 1;
64, 28, 16, 0, 0, 0, 0, 0, 0, 1;
80, 56, 24, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
96, 84, 24, 0, 0, 0, 0, 0, 0, 1;
128, 100, 40, 20, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
144, 156, 32, 0, 8, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
168, 188, 64, 16, 0, 4, 0, 0, 0, 0, 0, 0, 0, 1;
200, 228, 40, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
248, 252, 88, 24, 8, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;

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

Cf. A335350 (regions), A335351 (edges), A335352 (vertices), A335354 (edges in central polygon), A255011, A335057, A335192.

A335354 a(n) is the number of edges in the central polygon formed in a square by dividing each of its sides into n equal parts giving a total of 4n nodes and drawing straight line segments from node k to node (k+n+1) mod 4n, 0 <= k < 4*n.

Original entry on oeis.org

0, 8, 4, 8, 12, 16, 12, 16, 20, 16, 20, 24, 28, 24, 28, 32, 28, 32, 36, 32, 36, 40, 44, 40, 44, 48, 44, 48, 52, 56, 52, 56, 60, 56, 60, 64, 68, 64, 68, 72, 68, 72, 76, 72, 76, 80, 84, 80, 84, 88, 84, 88, 92, 96, 92, 96, 100, 96, 100, 104, 100, 104, 108, 112

Offset: 1

Lars Blomberg, Jun 04 2020

nonn

For n=1 there is no central polygon.
The number of edges of the central polygon tends to grow as n increases, whereas for n = 16..500 the polygon with next-to-most edges has 8 of them.
See A335350 for illustrations.

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

Cf. A335350 (regions), A335351 (edges), A335352 (vertices), A335353 (n-gons), A255011, A335057, A335192.

A335193 a(n) is the number of edges inside an n-gon formed by the straight line segments connecting vertex k to vertex 3k mod n.

Original entry on oeis.org

3, 5, 9, 14, 17, 15, 25, 38, 47, 35, 63, 78, 75, 57, 113, 114, 137, 115, 153, 186, 207, 143, 239, 266, 259, 245, 329, 326, 369, 287, 393, 446, 479, 403, 527, 566, 555, 473, 657, 626, 713, 659, 745, 818, 863, 687, 927, 978, 963, 933, 1097, 1086, 1169, 1007

Offset: 3

Lars Blomberg, May 26 2020

nonn

See A335192 for illustrations.

Lars Blomberg, Table of n, a(n) for n = 3..300

Cf. A335192 (regions), A335194 (vertices), A335195 (n-gons).

A335194 a(n) is the number of vertices inside an n-gon formed by the straight line segments connecting vertex k to vertex 3k mod n.

Original entry on oeis.org

3, 4, 6, 8, 10, 10, 14, 20, 25, 18, 33, 40, 39, 30, 58, 58, 70, 56, 78, 94, 105, 72, 121, 134, 131, 120, 166, 164, 186, 142, 198, 224, 241, 198, 265, 284, 279, 234, 330, 310, 358, 324, 374, 410, 433, 340, 465, 490, 483, 460, 550, 544, 586, 498, 606, 652, 681

Offset: 3

Lars Blomberg, May 26 2020

nonn

See A335192 for illustrations.

Lars Blomberg, Table of n, a(n) for n = 3..300

Cf. A335192 (regions), A335193 (edges), A335195 (n-gons).

A335195 Irregular table read by rows: T(n,k) = number of k-sided polygons for k >= 3 in an n-gon with straight line segments connecting vertex k to vertex 3k mod n.

Original entry on oeis.org

1, 2, 3, 1, 6, 1, 6, 1, 1, 4, 0, 2, 8, 3, 1, 10, 9, 13, 7, 2, 1, 14, 4, 14, 14, 3, 24, 7, 6, 2, 18, 14, 5, 18, 6, 4, 25, 24, 4, 3, 32, 13, 10, 2, 32, 21, 15, 42, 12, 0, 6, 32, 31, 13, 42, 35, 12, 4, 43, 45, 10, 3, 2, 38, 26, 4, 4, 44, 58, 15, 0, 2, 60, 49, 14, 10

Offset: 1

Lars Blomberg, May 26 2020

See A335192 for illustrations.

			The table begins
1;
2;
3, 1;
6, 1;
6, 1, 1;
4, 0, 2;
8, 3, 1;
10, 9;
13, 7, 2, 1;
14, 4;
14, 14, 3;
24, 7, 6, 2;
18, 14, 5;
18, 6, 4;
25, 24, 4, 3;
32, 13, 10, 2;
32, 21, 15;
42, 12, 0, 6;

Lars Blomberg, Table of n, a(n) for n = 1..1454 (rows 3-300)

Cf. A335192 (regions), A335193 (edges), A335194 (vertices).

cp's OEIS Frontend

A335350 a(n) is the number of regions formed in a square by dividing each of its sides into n equal parts giving a total of 4*n nodes and drawing straight line segments from node k to node (k+n+1) mod 4*n, 0 <= k < 4*n.

Views

Author

Keywords

Comments

Links

Crossrefs

A335351 a(n) is the number of edges formed in a square by dividing each of its sides into n equal parts giving a total of 4*n nodes and drawing straight line segments from node k to node (k+n+1) mod 4*n, 0 <= k < 4*n.

Views

Author

Keywords

Comments

Links

Crossrefs

A335352 a(n) is the number of vertices formed in a square by dividing each of its sides into n equal parts giving a total of 4*n nodes and drawing straight line segments from node k to node (k+n+1) mod 4*n, 0 <= k < 4*n.

Views

Author

Keywords

Comments

Links

Crossrefs

A335353 Irregular table read by rows: Take a square and divide each of its sides into n equal parts giving a total of 4*n nodes, draw straight line segments from node k to node (k+n+1) mod 4*n, 0 <= k < 4*n. Then T(n,k) = number of k-sided polygons in that figure for k >= 3.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A335354 a(n) is the number of edges in the central polygon formed in a square by dividing each of its sides into n equal parts giving a total of 4*n nodes and drawing straight line segments from node k to node (k+n+1) mod 4*n, 0 <= k < 4*n.

Views

Author

Keywords

Comments

Links

Crossrefs

A335193 a(n) is the number of edges inside an n-gon formed by the straight line segments connecting vertex k to vertex 3k mod n.

Views

Author

Keywords

Comments

Links

Crossrefs

A335194 a(n) is the number of vertices inside an n-gon formed by the straight line segments connecting vertex k to vertex 3k mod n.

Views

Author

Keywords

Comments

Links

Crossrefs

A335195 Irregular table read by rows: T(n,k) = number of k-sided polygons for k >= 3 in an n-gon with straight line segments connecting vertex k to vertex 3k mod n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A335350 a(n) is the number of regions formed in a square by dividing each of its sides into n equal parts giving a total of 4n nodes and drawing straight line segments from node k to node (k+n+1) mod 4n, 0 <= k < 4*n.

A335351 a(n) is the number of edges formed in a square by dividing each of its sides into n equal parts giving a total of 4n nodes and drawing straight line segments from node k to node (k+n+1) mod 4n, 0 <= k < 4*n.

A335352 a(n) is the number of vertices formed in a square by dividing each of its sides into n equal parts giving a total of 4n nodes and drawing straight line segments from node k to node (k+n+1) mod 4n, 0 <= k < 4*n.

A335353 Irregular table read by rows: Take a square and divide each of its sides into n equal parts giving a total of 4n nodes, draw straight line segments from node k to node (k+n+1) mod 4n, 0 <= k < 4*n. Then T(n,k) = number of k-sided polygons in that figure for k >= 3.

A335354 a(n) is the number of edges in the central polygon formed in a square by dividing each of its sides into n equal parts giving a total of 4n nodes and drawing straight line segments from node k to node (k+n+1) mod 4n, 0 <= k < 4*n.