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 A316669 #7 Aug 18 2019 04:33:13 %S A316669 1,2,3,5,4,6,9,7,8,10,14,11,12,13,15,20,16,17,18,19,21,27,22,23,24,25, %T A316669 26,28,35,29,30,31,32,33,34,36,44,37,38,39,40,41,42,43,45,54,46,47,48, %U A316669 49,50,51,52,53,55,65,56,57,58,59,60,61,62,63,64,66,77 %N A316669 Squares visited by queen moves on a diagonally numbered board and moving to the lowest available unvisited square at each step. %C A316669 Board is numbered as follows: %C A316669 1 2 4 7 11 16 . %C A316669 3 5 8 12 17 . %C A316669 6 9 13 18 . %C A316669 10 14 19 . %C A316669 15 20 . %C A316669 21 . %C A316669 . %C A316669 Same as A316588 but with queen move instead of knight move. %H A316669 Daniël Karssen, <a href="/A316669/b316669.txt">Table of n, a(n) for n = 1..10000</a> %H A316669 Daniël Karssen, <a href="/A316669/a316669.svg">Figure showing the first 22 steps of the sequence</a> %Y A316669 Cf. A316588, A316668, A316670, A316671. %K A316669 nonn %O A316669 1,2 %A A316669 _Daniël Karssen_, Jul 15 2018