cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A367173 a(n) = the maximum number of distinct tilings of a polyomino of size n using any combination of polyomino tiles of sizes 1 through n.

Original entry on oeis.org

1, 2, 4, 12, 24, 74, 148, 456, 1434, 2868, 8832, 27780
Offset: 1

Views

Author

John Mason from an idea of Craig Knecht, Nov 07 2023

Keywords

Comments

The sequence considers reflections and rotations as distinct tilings.
The polyominoes being tiled and the tiles themselves may be with or without holes.

Examples

			a(3) = 4 because any tromino can be tiled by (1) a tromino, (2) 3 monominoes, and (3) a monomino and a domino in two distinct ways.

Crossrefs

Cf. A000105, A367172, A367174.

A367174 a(n) = the maximum number of distinct tilings of a polyhex of size n using any combination of polyhex tiles of sizes 1 through n.

Original entry on oeis.org

1, 2, 5, 13, 26, 89, 233, 610, 2179, 5707
Offset: 1

Views

Author

John Mason from an idea of Craig Knecht, Nov 07 2023

Keywords

Comments

The sequence considers reflections and rotations as distinct tilings. The polyhexes being tiled and the tiles themselves may be with or without holes.

Examples

			a(3) = 5 because the polyhex of size 3 that has each cell touching both the other cells can be tiled by (1) a polyhex of size 3, (2) 3 polyhexes of size 1, and (3) a polyhex of size 1 and a polyhex of size 2 in three distinct ways.

Crossrefs

Cf. A000228, A367172, A367173.
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.