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.

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

Offset

1,2

Comments

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

Links

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

Example

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.

Sequence in context: A326511 A289463 A289579 * A322593 A289774 A126656

Adjacent sequences: A367171 A367172 A367173 * A367175 A367176 A367177

Keyword

nonn,more

Author

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

Status

approved