Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 Jun 12 2019 23:55:59
%S 1,8,11,14,5,2,9,4,7,12,3,6,55,32,13,10,31,16,19,22,25,18,15
%N 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 Like the trapped knights problem (A316667 and A316588), but starting in the corner of a board numbered by Hilbert's space-filling curve.
%C The knight traps itself after only 22 moves (checked manually).
%Y A316667 and A316588 inspired the idea.
%K nonn,fini,full
%O 1,2
%A _Gabriel Stauth_, Jun 07 2019