|
Search: id:A086676
|
|
|
| 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
1
|
| |
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
P. R. J. Ostergard and T. Riihonen, A covering problem for tori, Annals of Combinatorics, 7 (2003), 1-7.
|
|
LINKS
|
P. R. J. Ostergard, Home page
|
|
CROSSREFS
|
Sequence in context: A111388 A127884 A105858 this_sequence A039899 A039901 A121946
Adjacent sequences: A086673 A086674 A086675 this_sequence A086677 A086678 A086679
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, Jul 28 2003
|
|
EXTENSIONS
|
Ranges for the new few entries: [27,29], [41,44], [62,68], [93,104].
|
|
|
Search completed in 0.002 seconds
|
