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.

A346112 Size of the smallest regular polygon chain for a regular polygon with n sides.

Original entry on oeis.org

6, 4, 6, 3, 6, 4, 6, 5, 6, 3, 6, 4, 6, 4, 6, 3, 6, 4
Offset: 3

Views

Author

Stuart E Anderson, Jul 05 2021

Keywords

Comments

Each polygon in a polygon chain shares one edge with both its predecessor and successor polygon. The polygon chain forms a connected cycle.

Examples

			For n = 6, 3 hexagons can form a ring.  See the first link for this and further images.
		

Formula

Empirical observations for n >= 3:
a(n) = 3 if n == 0 (mod 6),
4 if n == 4 or 8 (mod 12),
5 if n = 10,
4 if n = 14,
6 otherwise.