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