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 A122224 #8 Mar 02 2018 14:20:39 %S A122224 1,4,8,14,21,32,40 %N A122224 Length of the longest possible self avoiding path on the 2-dimensional square lattice such that the path fits into a circle of diameter n. %C A122224 The path may be open or closed. For larger n several solutions with the same number of segments exist. %C A122224 It is conjectured that a(n) >= A123690(n)-1, i.e., that it is always possible to find a path visiting all grid points covered by a circle, irrespective of the position of its center. - _Hugo Pfoertner_, Mar 02 2018 %H A122224 Hugo Pfoertner, <a href="http://www.randomwalk.de/sequences/a122224.pdf">Examples of compact self avoiding paths on a square lattice</a>. %Y A122224 Cf. A122223, A122226, A123690. %K A122224 hard,more,nonn %O A122224 2,2 %A A122224 _Hugo Pfoertner_, Sep 25 2006