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 A357360 #8 Oct 02 2022 08:34:01 %S A357360 0,1,2,3,4,11,24 %N A357360 Maximum length of an induced path (or chordless path or snake path) between two antipodal nodes of the n-dimensional hypercube. %C A357360 The length is defined as the number of edges along the path, so the number of nodes of the longest path is a(n)+1. %F A357360 a(n) <= A099155(n). %e A357360 For n <= 4, the only induced paths between two antipodal nodes are the shortest paths, so a(n) = n. %e A357360 For n = 5, a longest induced path is 00000 - 10000 - 11000 - 11100 - 01100 - 01110 - 00110 - 00111 - 00011 - 10011 - 11011 - 11111, so a(5) = 11. %Y A357360 Cf. A099155 (the ends of the path does not have to be antipodal), A357234 (paths between opposite corners of a square grid). %Y A357360 Main diagonal of A357499. %K A357360 nonn,more %O A357360 0,3 %A A357360 _Pontus von Brömssen_, Sep 25 2022