[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
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
1, 1, 2, 2, 2, 14, 204
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
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.
LINKS
Table of n, a(n) for n=1..7.
John Mason, Illustrations of minimalist container polyominoes
CROSSREFS
Cf. A000105, A327094.
Sequence in context: A361815 A349564 A129409 * A025521 A305109 A372418
Adjacent sequences: A352026 A352027 A352028 * A352030 A352031 A352032
KEYWORD
nonn,more,hard
AUTHOR
John Mason, Mar 04 2022
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified November 30 15:42 EST 2024. Contains 378264 sequences.
License Agreements, Terms of Use, Privacy Policy