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.

A369363 Least number of inequivalent cells in a (planar) polyhex with n cells.

Original entry on oeis.org

1, 1, 1, 2, 2, 1, 2, 3, 2, 3, 4, 2, 3, 4, 3, 4
Offset: 1

Views

Author

Pontus von Brömssen, Jan 22 2024

Keywords

Comments

Equivalently, a(n) is the least number of free rooted (or pointed) polyhexes (A369362) corresponding to a given polyhex with n cells.

Crossrefs

Extensions

a(13)-a(16) from John Mason, Sep 24 2024