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.

A369367 Number of free n-celled polyiamonds with the least number (A369366(n)) of inequivalent cells.

This page as a plain text file.
%I A369367 #8 Sep 20 2024 10:13:11
%S A369367 1,1,1,3,2,1,1,1,1,4,27,1,1,6,2,1,523,1
%N A369367 Number of free n-celled polyiamonds with the least number (A369366(n)) of inequivalent cells.
%H A369367 <a href="/index/Pol#polyominoes">Index entries for sequences related to polyominoes</a>.
%Y A369367 Cf. A000577, A367759, A369364, A369366.
%K A369367 nonn,more
%O A369367 1,4
%A A369367 _Pontus von Brömssen_, Jan 22 2024
%E A369367 a(18) from _John Mason_, Sep 20 2024

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

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