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.

A339848 Number of distinct free polyominoes that fit in an n X n square but are not a proper sub-polyomino of any polyomino that fits in the square.

Original entry on oeis.org

1, 1, 1, 1, 3, 6, 16, 27, 44, 70
Offset: 1

Views

Author

Talmon Silver, Dec 19 2020

Keywords

Comments

A polyomino A is a proper sub-polyomino of B if one or more cells can be added to A to form B.
Except for the n X n polyomino that fills the square all of the other polyominoes must have their edges aligned at an angle to the sides of the square.
This counts the minimum subset of polyominoes needed to produce A268427 - that sequence counts the sub-polyominoes of this sequence.

Examples

			For n=1, 2, 3, 4 the only polyominoes are the n X n polyominoes. Thus, a(1)=a(2)=a(3)=a(4)=1.
For n=5 and n=6 all of the other polyominoes are shown in the links.
		

Crossrefs

Cf. A268427.