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

%I #6 Jan 10 2023 13:04:58

%S 1,1,1,1,1,1,1,5,1,1,3,1,1,5,1,1,2,2

%N 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.

%H John Mason, <a href="/A359667/a359667.pdf">Illustrations</a>

%e a(8) = 5 because each of the following octominoes will generate the minimum number of children given by A255890(8) = 3:

%e OO OOO OO O O

%e OO O O OOOO OOO OOO

%e OO OOO OO OOO OOO

%e OO O O

%Y Cf. A000105, A255890.

%K nonn,more

%O 1,8

%A _John Mason_, Jan 10 2023

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 17:15 EDT 2024. Contains 375369 sequences. (Running on oeis4.)