login
A151908
Number of nonisomorphic cube tilings of dimension n which can be constructed using the recipe presented at the beginning of Section 3 of the Lagarias-Shor paper.
0
1, 2, 3, 7, 22, 95
OFFSET
2,2
COMMENTS
A weak lower bound for a(8) is 404.
It appears that there is exactly one trivial tiling in each dimension. If so, and this tiling is excluded, we get a sequence which potentially matches two existing sequences in the OEIS.
LINKS
J. C. Lagarias and P. W. Shor, Cube-tilings of R^n and nonlinear codes, preprint, 1993.
J. C. Lagarias and P. W. Shor, Cube-tilings of R^n and nonlinear codes, Discrete and Computational Geometry, Vol. 11, pp. 359-391, 1994.
CROSSREFS
Sequence in context: A038159 A077210 A324620 * A072214 A233535 A007660
KEYWORD
nonn,hard,more
AUTHOR
Peter Shor, Jul 30 2009
STATUS
approved