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.

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

This page as a plain text file.
%I A369366 #8 Sep 20 2024 10:13:22
%S A369366 1,1,2,2,3,1,3,3,3,3,6,2,4,4,4,4,9,2
%N A369366 Least number of inequivalent cells in a polyiamond with n cells.
%C A369366 Equivalently, a(n) is the least number of free rooted (or pointed) polyiamonds (A369365) corresponding to a given polyiamond with n cells.
%H A369366 <a href="/index/Pol#polyominoes">Index entries for sequences related to polyominoes</a>.
%Y A369366 Cf. A000577, A367758, A369363, A369365, A369367.
%K A369366 nonn,more
%O A369366 1,3
%A A369366 _Pontus von Brömssen_, Jan 22 2024
%E A369366 a(18) from _John Mason_, Sep 20 2024