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

A072934

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

Terms

    a(0) =1a(1) =4a(2) =9a(3) =20a(4) =41a(5) =84a(6) =169a(7) =255

External references