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-2 of 2 results.

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.

Links

Crossrefs

Cf. A000228, A367758, A369362, A369364, A369366.

Extensions

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

A369365 Number of free rooted (or pointed) polyiamonds with n cells.

Original entry on oeis.org

1, 1, 2, 6, 16, 50, 150, 458, 1388, 4233, 12875, 39227, 119456, 363868, 1107912, 3372793, 10264156, 31228969
Offset: 1

Views

Author

Pontus von Brömssen, Jan 22 2024

Keywords

Links

Crossrefs

Cf. A000577, A126202, A369362, A369366.

Extensions

a(18) from John Mason, Sep 20 2024
Showing 1-2 of 2 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.