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.

A359667 a(n) is the number of minimally prolific free polyominoes, i.e., that can generate the least possible number of children by adding a square.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 3, 1, 1, 5, 1, 1, 2, 2
Offset: 1

Views

Author

John Mason, Jan 10 2023

Keywords

Examples

			a(8) = 5 because each of the following octominoes will generate the minimum number of children given by A255890(8) = 3:
  OO OOO  OO   O    O
  OO O O OOOO OOO   OOO
  OO OOO  OO   OOO OOO
  OO            O    O
		

Crossrefs