login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 1
1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 3, 1, 1, 5, 1, 1, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,8
LINKS
John Mason, Illustrations
EXAMPLE
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
Sequence in context: A340513 A180136 A346916 * A010129 A073050 A366426
KEYWORD
nonn,more
AUTHOR
John Mason, Jan 10 2023
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 22 15:44 EDT 2024. Contains 375369 sequences. (Running on oeis4.)