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.

Showing 1-1 of 1 results.

A371620 Fractal sequence based on a heptagon: a(n) = number of unobscured heptagons remaining after completing step n.

Original entry on oeis.org

1, 1, 8, 48, 266
Offset: 1

Views

Author

Gavin Lupo, Mar 29 2024

Keywords

Comments

Start with a single regular heptagon. The heptagon fractal is constructed by taking with the previous completed step, and overlapping it in its entirety to each vertex (excluding the top vertex as they overlap completely). Once constructed, any unobscured heptagons within are counted. "Unobscured" means no lines cross through it, and its shape is regular. See links for images.

Examples

			Start with a(1) = 1 unobscured heptagon. For the next step, take step 1's entire shape and place it at each vertex. Although the total number of heptagons is 7, only 1 unobscured heptagon remains, so a(2) = 1.

Links

Crossrefs

Cf. A371536.
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.