

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 LagariasShor paper.


0




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

Table of n, a(n) for n=2..7.
J. C. Lagarias and P. W. Shor, Cubetilings of R^n and nonlinear codes, preprint, 1993.
J. C. Lagarias and P. W. Shor, Cubetilings of R^n and nonlinear codes, Discrete and Computational Geometry, Vol. 11, pp. 359391, 1994.


CROSSREFS

Sequence in context: A038159 A077210 A324620 * A072214 A233535 A007660
Adjacent sequences: A151905 A151906 A151907 * A151909 A151910 A151911


KEYWORD

nonn,hard,more


AUTHOR

Peter Shor, Jul 30 2009


STATUS

approved



