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 A359667 #6 Jan 10 2023 13:04:58 %S A359667 1,1,1,1,1,1,1,5,1,1,3,1,1,5,1,1,2,2 %N A359667 a(n) is the number of minimally prolific free polyominoes, i.e., that can generate the least possible number of children by adding a square. %H A359667 John Mason, <a href="/A359667/a359667.pdf">Illustrations</a> %e A359667 a(8) = 5 because each of the following octominoes will generate the minimum number of children given by A255890(8) = 3: %e A359667 OO OOO OO O O %e A359667 OO O O OOOO OOO OOO %e A359667 OO OOO OO OOO OOO %e A359667 OO O O %Y A359667 Cf. A000105, A255890. %K A359667 nonn,more %O A359667 1,8 %A A359667 _John Mason_, Jan 10 2023