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 A234013 #27 Jul 09 2019 13:06:10 %S A234013 1,1,2,1,1,11,8,3,1,79,36,8,2,540,164,31,4,3174,749,106,11,17443,3312, %T A234013 397,27 %N A234013 Number of maximally biased free polyominoes with n squares. %C A234013 Define the bias of a polyomino to be the difference between the number of black squares and the number of white squares when chessboard coloring is applied to the polyomino. Maximally biased polyominoes of size n are those sharing the maximum value of bias among all polyominoes of n squares. For n = 4m + 1, for integer m, all maximally biased polyominoes may be built starting with a monomino and then successively adding "airplane" tetrominoes. %H A234013 John Mason, <a href="/A234013/a234013.pdf">Chessboard coloured polyominoes and bias</a> %H A234013 Herman Tulleken, <a href="https://www.researchgate.net/publication/333296614_Polyominoes">Polyominoes 2.2: How they fit together</a>, (2019). %Y A234013 Cf. A000105, A106249, A001933, A234012. %K A234013 nonn,more,nice %O A234013 1,3 %A A234013 _John Mason_, Dec 27 2013 %E A234013 More terms from _John Mason_, Jan 03 2015