A342577 a(n) is the number of (not necessarily connected) tiles at distance n from the leftmost tile in the Hofstetter-4fold tiling.

1, 3, 4, 6, 9, 11, 11, 13, 15, 19, 16, 20, 25, 25, 27, 27, 29, 35, 30, 34, 41, 41, 39, 41, 47, 45, 44, 48, 57, 53, 57, 55, 57, 67, 56, 62, 73, 71, 67, 69, 73, 79, 68, 76, 89, 83, 87, 83, 93, 89, 86, 90, 105, 99, 95, 97, 109, 99, 100, 104, 121, 109, 117, 111

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 connected tiles (whose squares are vertically or horizontally adjacent) as well as disconnected tiles (made up of two diagonally adjacent squares).

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 A342577

Tilings Encyclopedia, Hofstetter-4fold (plain)

Example

See illustration in Links section.

Prog

(C#) See Links section.

Crossrefs

Cf. A342425, A342597.

Sequence in context: A124093 A025061 A284741 * A037969 A329862 A153236

Adjacent sequences: A342574 A342575 A342576 * A342578 A342579 A342580

Keyword

nonn

Author

Rémy Sigrist, Mar 15 2021

Status

approved