A367124 Maximum degree of the n-omino graph defined in A098891.

0, 0, 1, 4, 10, 28, 39, 68, 81, 116, 140, 186, 204

Offset: 1

Author

Pontus von Brömssen, Nov 05 2023

Keywords

• nonn
• more

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).

Examples

			For 1 <= n <= 12, the following polyominoes have the maximum degree in the polyomino graph of their respective sizes (see also link):
                                                _             _
             _           _        _    _      _| |     _     | |
        _   | |   _     | |     _| |  | |_   |_  |   _| |    | |_
   _   | |  | |  | |_   | |_   |_  |  |   |    | |  |_  |_   |   |
  |_|  |_|  |_|  |_ _|  |_ _|    |_|  |_ _|    |_|    |_ _|  |_ _|
                     _          _      _        _
     _      _       | |       _| |    | |      | |_      _ _
   _| |    | |      | |      |_  |_   | |_ _   |   |_   |   |_ _
  |_  |_   | |_ _   | |_ _     |   |  |  _  |  |  _  |  |  _ _  |
    |   |  |     |  |     |    |   |  | |_| |  | |_| |  | |_ _| |
    |_ _|  |_ _ _|  |_ _ _|    |_ _|  |_ _ _|  |_ _ _|  |_ _ _ _|
		

Links

• Pontus von Brömssen, Polyominoes of maximum degree for 1 <= n <= 13.
• Index entries for sequences related to polyominoes.

Crossrefs

Cf. A098891, A367123, A367125, A367437.

Row maxima of A367126.

Formula

a(n) >= A367437(n).