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 A323810 #9 Jan 30 2019 14:26:00 %S A323810 1,8,6,2,12,9,4,3,13,7,5,10,26,18,11,30,24,16,38,31,22,17,25,20,28,34, %T A323810 14,21,43,33,27,19,15,35,42,32,23,29,39,47,56,69,37,48,40,51,60,70,57, %U A323810 67,81,46,58,49,41,52,44,55,64,36,65,53,45,76,63,54,66,103,88,74,61 %N A323810 Squares visited by a knight on a diagonally numbered board and moving to the lowest available unvisited square at each step and if no unvisited squares are available move one step back. %C A323810 Board is numbered as follows: %C A323810 1 2 4 7 11 16 . %C A323810 3 5 8 12 17 . %C A323810 6 9 13 18 . %C A323810 10 14 19 . %C A323810 15 20 . %C A323810 21 . %C A323810 . %C A323810 Coincides with A316588 for the first 2402 terms. - _Daniël Karssen_, Jan 30 2019 %H A323810 Daniël Karssen, <a href="/A323810/b323810.txt">Table of n, a(n) for n = 1..100000</a> %H A323810 Daniël Karssen, <a href="/A323810/a323810.svg">Figure showing the first 1e5 steps of the sequence</a> %Y A323810 The sequences involved in this set of related sequences are A316588, A316328, A316334, A316667, A323808, A323809, A323810, and A323811. %K A323810 nonn %O A323810 1,2 %A A323810 _Daniël Karssen_, Jan 28 2019