login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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

%I

%S 1,2,3,7,22,95

%N 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.

%C A weak lower bound for a(8) is 404.

%C 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.

%H J. C. Lagarias and P. W. Shor, <a href="http://math.mit.edu/~shor/papers/cube-tilings.pdf">Cube-tilings of R^n and nonlinear codes</a>, preprint, 1993.

%H J. C. Lagarias and P. W. Shor, <a href="https://doi.org/10.1007/BF02574014">Cube-tilings of R^n and nonlinear codes</a>, Discrete and Computational Geometry, Vol. 11, pp. 359-391, 1994.

%K nonn,hard,more

%O 2,2

%A _Peter Shor_, Jul 30 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 28 17:37 EDT 2020. Contains 334684 sequences. (Running on oeis4.)