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 A275103 #19 Aug 03 2017 08:22:59 %S A275103 1,2,3,4,2,3,1,5,4,2,5,1,2,6,5,4,3,5,1,6,7,8,9,10,6,3,4,8,7,9,8,11,2, %T A275103 1,8,4,1,6,10,3,9,5,7,11,3,10,6,4,9,10,1,7,11,3,9,12,4,8,5,7,11,13,12, %U A275103 6 %N A275103 Hilbert curve constructed by greedy algorithm, such that each element is the smallest positive integer possible and that all rows, columns, and diagonals contain distinct numbers. %C A275103 The n-th cell has x-coordinates given by A059252 and y-coordinates given by A059253. %C A275103 This idea is similar to A269526 and A274640, but for a different curve. %H A275103 Kerry Mitchell, <a href="/A275103/b275103.txt">Table of n, a(n) for n = 0..4095</a> %e A275103 The Hilbert curve begins: %e A275103 1, 4, 2, 3, ... %e A275103 2, 3, 5, 1, ... %e A275103 5, 6, 4, 2, ... %e A275103 4, 2, 1, 5, ... %e A275103 ... %Y A275103 Cf. A269526 uses antidiagonals instead of the Hilbert curve and A274640 uses a square spiral. %K A275103 nonn %O A275103 0,2 %A A275103 _Kerry Mitchell_, Jul 16 2016