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.

A369366 Least number of inequivalent cells in a polyiamond with n cells.

Original entry on oeis.org

1, 1, 2, 2, 3, 1, 3, 3, 3, 3, 6, 2, 4, 4, 4, 4, 9, 2
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) polyiamonds (A369365) corresponding to a given polyiamond with n cells.

Links

Crossrefs

Cf. A000577, A367758, A369363, A369365, A369367.

Extensions

a(18) from John Mason, Sep 20 2024

A369364 Number of free n-celled (planar) polyhexes with the least number (A369363(n)) of inequivalent cells.

Original entry on oeis.org

1, 1, 1, 5, 1, 1, 1, 7, 3, 9, 9, 4, 2, 27, 10, 4
Offset: 1

Views

Author

Pontus von Brömssen, Jan 22 2024

Keywords

Links

Crossrefs

Cf. A000228, A367759, A369363, A369367.

Extensions

a(13)-a(16) from John Mason, Sep 24 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.