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.

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

Author

Lars Blomberg, Jun 04 2020

Keywords

• nonn

Comments

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

See A335350 for illustrations.

Links

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

Crossrefs

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