login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072934 Length of longest non-crossing walk along vertices of n-dimensional hypercubes. 0
1, 4, 9, 20, 41, 84, 169, 255 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Found using greedy algorithm.
LINKS
FORMULA
Note that it is not true that a(n+1)>2*a(n): 255 = a(8) < 2*a(7) = 2*169 = 338. - Stefan Steinerberger, Mar 14 2006
CROSSREFS
A000937 studies a similar problem.
Sequence in context: A192956 A023607 A117074 * A084639 A272268 A284736
KEYWORD
more,nonn
AUTHOR
George Taylor (taylorg(AT)hushmail.com), Aug 20 2002
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)