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 A367124 #11 Nov 19 2023 11:36:19 %S A367124 0,0,1,4,10,28,39,68,81,116,140,186,204 %N A367124 Maximum degree of the n-omino graph defined in A098891. %C A367124 Largest number of free polyominoes that can be made from a polyomino with n cells by moving one of its cells (not counting itself). %H A367124 Pontus von Brömssen, <a href="/A367124/a367124.svg">Polyominoes of maximum degree for 1 <= n <= 13</a>. %H A367124 <a href="/index/Pol#polyominoes">Index entries for sequences related to polyominoes</a>. %F A367124 a(n) >= A367437(n). %e A367124 For 1 <= n <= 12, the following polyominoes have the maximum degree in the polyomino graph of their respective sizes (see also link): %e A367124 _ _ %e A367124 _ _ _ _ _| | _ | | %e A367124 _ | | _ | | _| | | |_ |_ | _| | | |_ %e A367124 _ | | | | | |_ | |_ |_ | | | | | |_ |_ | | %e A367124 |_| |_| |_| |_ _| |_ _| |_| |_ _| |_| |_ _| |_ _| %e A367124 _ _ _ _ %e A367124 _ _ | | _| | | | | |_ _ _ %e A367124 _| | | | | | |_ |_ | |_ _ | |_ | |_ _ %e A367124 |_ |_ | |_ _ | |_ _ | | | _ | | _ | | _ _ | %e A367124 | | | | | | | | | |_| | | |_| | | |_ _| | %e A367124 |_ _| |_ _ _| |_ _ _| |_ _| |_ _ _| |_ _ _| |_ _ _ _| %Y A367124 Cf. A098891, A367123, A367125, A367437. %Y A367124 Row maxima of A367126. %K A367124 nonn,more %O A367124 1,4 %A A367124 _Pontus von Brömssen_, Nov 05 2023