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.

A341219 Number of well-connected free polyominoes with n cells, where a polyomino is defined as well-connected if, for all the squares it contains, the removal of that single square would result in an intact polyomino.

Original entry on oeis.org

1, 1, 1, 0, 1, 0, 1, 0, 3, 1, 6, 2, 25, 18, 88
Offset: 0

Views

Author

John Mason, Feb 07 2021

Keywords

Comments

Examples of well-connected polyominoes are rectangles and loops:
.
XXXX
XXXX (rectangle)
.
XXX
X X (loop)
XXX

Examples

			a(4) = 1 because the 2 X 2 square polyomino is the only tetromino to be well-connected. The removal of any single square always results in an intact tromino. In each of the other 4 tetrominoes, there is a square whose removal would result in something that is not an intact polyomino.
		

Crossrefs

Cf. A000105.