This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A072934 #6 Nov 05 2024 19:45:50 %S A072934 1,4,9,20,41,84,169,255 %N A072934 Length of longest non-crossing walk along vertices of n-dimensional hypercubes. %C A072934 Found using greedy algorithm. %C A072934 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 %C A072934 This sequence needs a better definition and an explanation as to what "greedy algorithm" means in this context. - _Sean A. Irvine_, Nov 05 2024 %Y A072934 A000937 studies a similar problem. %K A072934 more,nonn,obsc %O A072934 1,2 %A A072934 George Taylor (taylorg(AT)hushmail.com), Aug 20 2002