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!)
A342430 Number of prime polyominoes with n cells. 0
0, 0, 1, 2, 1, 12, 5, 108, 145, 974, 2210, 17073, 31950, 238591, 587036, 3174686, 9236343, 50107909 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
We say that a free polyomino is prime if it cannot be tiled by any other free polyomino besides the 1 X 1 square and itself.
The tiling of P must be with a single polyomino, and that single polyomino may not be the unique monomino or P itself. For example, decomposing the T-tetromino into a 3 X 1 and a 1 X 1 would use multiple tiles, and this is not permitted.
It can be shown that a(n) > 0 for all n >= 4, by considering the polyomino whose cells are at (0,1), (-1,1), (0,2), and (x,0) for all x = 0, 1, ..., n-4.
LINKS
Cibulis, Liu, and Wainwright, Polyomino Number Theory (I), Crux Mathematicorum, 28(3) (2002), 147-150.
FORMULA
a(n) = A000105(n) if n is prime.
EXAMPLE
For n = 4, the T-tetromino cannot be decomposed into smaller congruent polyominoes:
+---+
| |
+---+ +---+
| |
+-----------+
The other four free tetrominoes can, however:
+---+
| |
| | +---+
| | | |
+---+ | | +---+---+ +---+---+
| | | | | | | | |
| | +---+---+ | | | +---+---+---+
| | | | | | | | |
+---+ +-------+ +---+---+ +---+---+
Thus a(4) = 1.
CROSSREFS
Sequence in context: A370552 A167128 A332749 * A181417 A048743 A049055
KEYWORD
nonn,hard,more,nice
AUTHOR
Drake Thomas, Mar 11 2021
EXTENSIONS
a(14)-a(17) from John Mason, Sep 16 2022
a(1) corrected by John Mason, Feb 27 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 May 13 15:16 EDT 2024. Contains 372520 sequences. (Running on oeis4.)