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 A308562 #10 Jun 12 2019 23:55:59 %S A308562 1,8,11,14,5,2,9,4,7,12,3,6,55,32,13,10,31,16,19,22,25,18,15 %N A308562 Squares visited a knight moving on a board numbered by Hilbert's space-filling curve and moving to the lowest-numbered available unvisited square at each step. %C A308562 Like the trapped knights problem (A316667 and A316588), but starting in the corner of a board numbered by Hilbert's space-filling curve. %C A308562 The knight traps itself after only 22 moves (checked manually). %Y A308562 A316667 and A316588 inspired the idea. %K A308562 nonn,fini,full %O A308562 1,2 %A A308562 _Gabriel Stauth_, Jun 07 2019