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 A122223 #7 Jan 06 2019 12:57:22 %S A122223 1,6,6,12,15,23,33,42,53,62,74,90,103 %N A122223 Length of the longest possible self avoiding path on the 2-dimensional honeycomb net such that the path fits into a circle of diameter n. %C A122223 The path may be open or closed. For larger n several solutions with the same number of segments exist. An upper bound for the number of segments is given by A127406(n). %H A122223 Hugo Pfoertner, <a href="http://www.randomwalk.de/sequences/a122223.pdf">Examples of compact self avoiding paths on a honeycomb net</a>. %Y A122223 Cf. A122224, A122226, A127406. %K A122223 hard,more,walk,nonn %O A122223 1,2 %A A122223 _Hugo Pfoertner_, Sep 25 2006, Feb 11 2007