The number of ways that a straight line segment of length n, marked into n equal units, can be surrounded in a plane by one layer of regular polygons of unit edge that fit together without any gaps or overlaps, such that every polygon shares either a vertex or an exact unit edge with the segment. ("Line wreaths of length n.") Ways that differ by reflection or rotation are not counted as different.

A158091

The number of ways that a straight line segment of length n, marked into n equal units, can be surrounded in a plane by one layer of regular polygons of unit edge that fit together without any gaps or overlaps, such that every polygon shares either a vertex or an exact unit edge with the segment. ("Line wreaths of length n.") Ways that differ by reflection or rotation are not counted as different.

Terms

    a(0) =21a(1) =114a(2) =154a(3) =348a(4) =748a(5) =1824a(6) =4402a(7) =11177a(8) =28334a(9) =73281a(10) =189501a(11) =493774a(12) =1286655a(13) =3362376a(14) =8787092a(15) =22988862a(16) =60144668a(17) =157418794

External references