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 A286194 #35 Feb 16 2025 04:34:34 %S A286194 0,2,11,60,302,1523,7384,35188,164036,753310 %N A286194 Number of (n,2)-polyominoes. %C A286194 (n,k)-polyominoes are disconnected polyominoes with n visible squares and k transparent squares. Importantly, k must be the least number of transparent squares that need to be converted to visible squares to make all the visible squares connected. Note that a regular polyomino of order n is a (n,0)-polyomino, since all its visible squares are already connected. For more details see the paper by Kamenetsky and Cooke. %H A286194 Dmitry Kamenetsky and Tristrom Cooke, <a href="https://arxiv.org/abs/1411.2699">Tiling rectangles with holey polyominoes</a>, arXiv:1411.2699 [cs.CG], 2015. %e A286194 We can represent these polyominoes as binary matrices, where 1 means visible square and 0 means transparent square. Note that we need to flip (change to 1) two 0's to make all the 1's connected. This also means that the Manhattan distance between any pair of 1's is at most 3. Here are all such polyominoes for n=2: %e A286194 1001 100 %e A286194 001 %Y A286194 Cf. A286344, A286345, A381030. %K A286194 nonn,more %O A286194 1,2 %A A286194 _Dmitry Kamenetsky_, May 05 2017 %E A286194 a(6) corrected and a(7)-a(10) from _John Mason_, Feb 15 2025