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 A246925 #16 Oct 19 2014 15:45:57 %S A246925 0,3,2,3,2,3,4,5,3,4,1,2,3,4,3,4,2,1,4,3,2,3,4,5,3,2,3,2,3,4,3,4,2,3, %T A246925 2,3,4,3,4,5,3,4,3,4,3,4,5,4,4,3,4,3,4,5,4,5,5,4,5,4,5,4,5,6 %N A246925 8 X 8 square array read by rows: T(i,j) = number of moves of a knight to reach the square (i,j) when starting from the corner square (1,1). %C A246925 The initial position needs no moves to be reached and is set to value 0 %C A246925 Read by rows: %C A246925 a(1) a(2) .... a(8) %C A246925 a(9) a(10) .... a(16) %C A246925 .... %C A246925 .... %C A246925 a(57) a(58) .... a(64) %Y A246925 Cf. A018837, A246924. See A065775 for the analog on an infinite board. %K A246925 nonn,easy,full,tabf,fini %O A246925 1,2 %A A246925 _Frieder Mittmann_, Sep 07 2014