cp's OEIS Frontend

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.

A268404 Number of fixed polyominoes that have a width and height of n.

Original entry on oeis.org

1, 5, 111, 7943, 1890403, 1562052227, 4617328590967, 49605487608825311, 1951842619769780119767, 282220061839181920696642671, 150134849621798165832163223922131, 293909551918134914019004192289440616787, 2116817972794640259940977362779552773322908743
Offset: 1

Views

Author

Craig Knecht, Feb 03 2016

Keywords

Comments

Iwan Jensen originally provided this sequence.
The sequence also describes the water patterns of lakes in the water retention model.
A lake is defined as a body of water with dimensions of n X n when the size of the square is (n+2) X (n+2). All other bodies of water are ponds.
The 3 X 3 square serves as a tutorial for the following three nomenclatures: (1) The total number of distinct water patterns is 102 and includes lakes and ponds. (2) The number of free lake-type polyominoes is 24. (3) The number of fixed lake-type polyominoes is 111. See the explanatory graphics in the link section.
John Mason has looked at free polyominoes in rectangles; see A268371.
Anna Skelt initiated the discussion on the definition of a lake.

Examples

			There are many interesting ways to connect all boundaries of the square with the smallest number of edge-joined cells.
  0 0 0 0 1 0
  0 0 0 0 1 1
  0 0 1 1 1 0
  0 0 1 0 0 0
  1 1 1 0 0 0
  0 1 0 0 0 0
		

Crossrefs

Main diagonal of A292357.
Cf. A054247 (all unique water retention patterns for an n X n square), A268311 (free polyominoes that connect all boundaries on a square), A268339 (lake patterns that are invariant to all transformations).

Programs

Extensions

a(12)-a(13) from Andrew Howroyd, Oct 02 2017