Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086676
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
2, 3, 5, 8, 12, 18, 29, 44 (list; graph; listen)
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, to appear. [From David Brink (brink(AT)math.ku.dk), Jun 03 2009]

LINKS

P. R. J. Ostergard, Home page

CROSSREFS

Sequence in context: A130732 A018135 A065435 this_sequence A055804 A124062 A099823

Adjacent sequences: A086673 A086674 A086675 this_sequence 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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research