login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A286194 Number of (n,2)-polyominoes. 2
0, 2, 11, 60, 302, 1522 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

(n,k)-polyominoes are disconnected polyominoes with n visible squares and k transparent squares. Importantly, k must be the least number of transparent squares that need to be converted to visible squares to make all the visible squares connected. Note that a regular polyomino of order n is a (n,0)-polyomino, since all its visible squares are already connected. For more details see the paper by Kamenetsky and Cooke.

LINKS

Table of n, a(n) for n=1..6.

Dmitry Kamenetsky and Tristrom Cooke, Tiling rectangles with holey polyominoes, arXiv:1411.2699 [cs.CG], 2015.

EXAMPLE

We can represent these polyominoes as binary matrices, where 1 means visible square and 0 means transparent square. Note that we need to flip (change to 1) two 0's to make all the 1's connected. This also means that the Manhattan distance between any pair of 1's is at most 3. Here are all such polyominoes for n=2:

1001 100

     001

CROSSREFS

Cf. A286344, A286345.

Sequence in context: A228868 A290116 A251180 * A164034 A240548 A255549

Adjacent sequences:  A286191 A286192 A286193 * A286195 A286196 A286197

KEYWORD

nonn,more

AUTHOR

Dmitry Kamenetsky, May 05 2017

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 21 18:36 EDT 2021. Contains 348155 sequences. (Running on oeis4.)