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.

A268311 Number of free polyominoes that form a continuous path of edge joined cells spanning an n X n square in both dimensions.

Original entry on oeis.org

1, 2, 24, 1051, 238048, 195284973, 577169894573, 6200686124225191
Offset: 1

Views

Author

Craig Knecht, Jan 31 2016

Keywords

Comments

This idea originated from the water retention model for mathematical surfaces and is identical to the concept of a "lake". A lake is body of water that has dimensions of (n-2) X (n-2) when the square size is n X n. All other bodies of water are "ponds".
Iwan Jensen with his transfer matrix algorithm provided the number of symmetrically redundant solutions. Walter Trump enumerated the symmetrically unique solutions.

Examples

			The cells with value 1 show the smallest possible lake in this 4 X 4 square:
1 1 1 1
0 0 0 1
0 0 0 1
0 0 0 1
a(3)=24 = 6+7+7+3+1: There fit 6 5-ominoes in a 3x3 square, 7 6-ominoes in a 3x3 square, 7 7-ominoes in a 3x3 square, 3 8-ominoes in a 3x3 square, a 1 9-omino in a 3x3 square. - _R. J. Mathar_, Jun 07 2020
		

Crossrefs

Cf. A054247 (all unique water retention patterns). Diagonal of A268371.
Cf. A259088.

Extensions

a(6) corrected. Craig Knecht, May 25 2020