OFFSET
0,2
COMMENTS
We build the Hofstetter-4fold tiling as follows:
- H_0 corresponds to a 2 X 2 square:
+---+---+
| |
+ +
| |
+---+---+
O
- for any k >= 0, H_{k+1} is obtained by arranging 4 copies of H_k, rotated by 0, 90, 180, 270 degrees clockwise respectively, as follows:
+.......+
. 90.
+.......+ +.......+ ....+
. . .0 . . .
. . --> . ..... .
. . . . 180.
+.......+ +.......+.......+
O O .270 .
+.......+
- note that:
- the copy rotated by 0 degrees hides some squares on the copies rotated by 90 and 270 degrees,
- the copy rotated by 90 degrees hides some squares on the copy rotated by 180 degrees,
- the copy rotated by 180 degrees hides some squares on the copy rotated by 270 degrees,
- the Hofstetter-4fold tiling corresponds to the limit of H_k as k tends to infinity,
- in this sequence we consider only connected tiles (whose squares are vertically or horizontally adjacent); disconnected tiles made up of two diagonally adjacent squares are counted as two distinct connected tiles.
LINKS
Rémy Sigrist, Table of n, a(n) for n = 0..5000
Rémy Sigrist, Illustration of initial terms
Rémy Sigrist, Colored representation of the tiles at distance <= 512 (where the color is function of the distance)
Rémy Sigrist, C# program for A342425
Tilings Encyclopedia, Hofstetter-4fold (plain)
EXAMPLE
See illustration in Links section.
PROG
(C#) See Links section.
CROSSREFS
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Mar 11 2021
STATUS
approved