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

KEYWORD

nonn,hard,more

AUTHOR

Peter Shor, Jul 30 2009

STATUS

approved