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.

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

Author

Lars Blomberg, Jun 04 2020

Keywords

• nonn

Comments

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.

Links

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

Crossrefs

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