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.

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.

Table of values

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

List of values

[21, 114, 154, 348, 748, 1824, 4402, 11177, 28334, 73281, 189501, 493774, 1286655, 3362376, 8787092, 22988862, 60144668, 157418794]