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.
%I A369363 #9 Sep 24 2024 09:15:39 %S A369363 1,1,1,2,2,1,2,3,2,3,4,2,3,4,3,4 %N A369363 Least number of inequivalent cells in a (planar) polyhex with n cells. %C A369363 Equivalently, a(n) is the least number of free rooted (or pointed) polyhexes (A369362) corresponding to a given polyhex with n cells. %H A369363 <a href="/index/Pol#polyominoes">Index entries for sequences related to polyominoes</a>. %Y A369363 Cf. A000228, A367758, A369362, A369364, A369366. %K A369363 nonn,more %O A369363 1,4 %A A369363 _Pontus von Brömssen_, Jan 22 2024 %E A369363 a(13)-a(16) from _John Mason_, Sep 24 2024