login
A367124
Maximum degree of the n-omino graph defined in A098891.
7
0, 0, 1, 4, 10, 28, 39, 68, 81, 116, 140, 186, 204
OFFSET
1,4
COMMENTS
Largest number of free polyominoes that can be made from a polyomino with n cells by moving one of its cells (not counting itself).
FORMULA
a(n) >= A367437(n).
EXAMPLE
For 1 <= n <= 12, the following polyominoes have the maximum degree in the polyomino graph of their respective sizes (see also link):
_ _
_ _ _ _ _| | _ | |
_ | | _ | | _| | | |_ |_ | _| | | |_
_ | | | | | |_ | |_ |_ | | | | | |_ |_ | |
|_| |_| |_| |_ _| |_ _| |_| |_ _| |_| |_ _| |_ _|
_ _ _ _
_ _ | | _| | | | | |_ _ _
_| | | | | | |_ |_ | |_ _ | |_ | |_ _
|_ |_ | |_ _ | |_ _ | | | _ | | _ | | _ _ |
| | | | | | | | | |_| | | |_| | | |_ _| |
|_ _| |_ _ _| |_ _ _| |_ _| |_ _ _| |_ _ _| |_ _ _ _|
CROSSREFS
Row maxima of A367126.
Sequence in context: A222453 A186278 A367437 * A222963 A333172 A257028
KEYWORD
nonn,more
AUTHOR
STATUS
approved