A072934 Length of longest non-crossing walk along vertices of n-dimensional hypercubes.

1, 4, 9, 20, 41, 84, 169, 255

Offset: 1

Author

George Taylor (taylorg(AT)hushmail.com), Aug 20 2002

Keywords

• more
• nonn
• obsc

Comments

Found using greedy algorithm.

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

This sequence needs a better definition and an explanation as to what "greedy algorithm" means in this context. - Sean A. Irvine, Nov 05 2024

Crossrefs

A000937 studies a similar problem.