login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A367524
The number of ways of tiling the n X n grid up to the symmetries of the square by a tile that is fixed under horizontal reflection, but no other symmetries of the square.
8
1, 39, 32896, 536895552, 140737496743936, 590295810384475521024, 39614081257132309534260330496, 42535295865117307939839354957685850112, 730750818665451459101843020821051317142553624576, 200867255532373784442745261543120694290360960529885344825344
OFFSET
1,2
COMMENTS
Also, this is the number ways of tiling the n X n grid up to the symmetries of the square by a tile that is fixed under 180-degree rotation, but no other symmetries of the square.
LINKS
Peter Kagey and William Keehn, Counting tilings of the n X m grid, cylinder, and torus, arXiv: 2311.13072 [math.CO], 2023. See also J. Int. Seq., (2024) Vol. 27, Art. No. 24.6.1, pp. A-6, A-7, A-8.
FORMULA
a(2m-1) = 2^(4m^2 - 4m - 2)*(2 + 2^(2m-1)^2).
a(2m) = 2^(2m^2 - 3)*(2 + 3*4^m^2 + 64^m^2).
MATHEMATICA
Table[{2^(4 m^2 - 4 m - 2) (2 + 2^(2 m - 1)^2), 2^(2 m^2 - 3) (2 + 3*4^m^2 + 64^m^2)}, {m, 1, 5}] // Flatten
CROSSREFS
KEYWORD
nonn
AUTHOR
Peter Kagey, Dec 10 2023
STATUS
approved