The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A352029 a(n) is the number of minimalist polyominoes that can contain all n-ominoes. 1

%I #12 Mar 05 2022 01:36:44

%S 1,1,2,2,2,14,204

%N a(n) is the number of minimalist polyominoes that can contain all n-ominoes.

%C a(n) is the number of free polyominoes that can contain all n-ominoes and that have size A327094(n), which is the minimum size for such a polyomino.

%H John Mason, <a href="/A352029/a352029.pdf">Illustrations of minimalist container polyominoes</a>

%Y Cf. A000105, A327094.

%K nonn,more,hard

%O 1,3

%A _John Mason_, Mar 04 2022

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 June 8 17:52 EDT 2024. Contains 373227 sequences. (Running on oeis4.)