|
| |
|
|
A086676
|
|
Number of n-dimensional 2 X 2 X ... X 2 grid graphs needed to cover an n-dimensional 3 X 3 X ... X 3 torus.
|
|
0
| | |
|
|
|
OFFSET
| 1,1
|
|
|
REFERENCES
| P. R. J. Ostergard and T. Riihonen, A covering problem for tori, Annals of Combinatorics, 7 (2003), 1-7.
D. Brink, The inverse football pool problem, Journal of Integer Sequences, 14 (2011), 1-9 (Article 11.8.8).
|
|
|
LINKS
| P. R. J. Ostergard, Home page
|
|
|
CROSSREFS
| Sequence in context: A130732 A018135 A065435 * A055804 A124062 A099823
Adjacent sequences: A086673 A086674 A086675 * A086677 A086678 A086679
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Jul 28 2003
|
|
|
EXTENSIONS
| I have added two terms (29 and 44). The ranges for the next terms are [66,68] and [99,104]. David Brink (brink(AT)math.ku.dk), Jun 03 2009
|
| |
|
|
