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 A242591 #24 Jan 03 2025 18:22:29 %S A242591 1,12,2,2,1,54,6,2,9,2,2,6,1,3,32,6,28,6,24,3,8,24,3,18,1,12,85,6,100, %T A242591 16,95,12,60,4,25,240,6,70,4,50,1,30,201,10,60,40,330,35,266,20,150,5, %U A242591 66,588,20,210,10,180,5,120,1,60,462,15,147,1512 %N A242591 Triangle of number of shortest knight paths T(n,k) from square (0,0) at center of an infinite open chessboard to square (n,k), for 0 <= k <= n. %H A242591 Georg Fischer, <a href="/A242591/b242591.txt">Table of n, a(n) for n = 0..209</a> %H A242591 Fred Lunnon, <a href="/A242591/a242591.a.txt">Revised tables & functions for knight's path distance and count (MAGMA code)</a> %e A242591 Triangle starts: %e A242591 1; %e A242591 12, 2; %e A242591 2, 1, 54; %e A242591 6, 2, 9, 2; %e A242591 2, 6, 1, 3, 32; %e A242591 6, 28, 6, 24, 3, 8; %e A242591 24, 3, 18, 1, 12, 85, 6; %e A242591 100, 16, 95, 12, 60, 4, 25, 240; %e A242591 6, 70, 4, 50, 1, 30, 201, 10, 60; %e A242591 40, 330, 35, 266, 20, 150, 5, 66, 588, 20; %e A242591 ... %e A242591 See examples under A242511. %o A242591 (Magma) // See attached a-file for recursive & explicit algorithms. %Y A242591 Cf. A242511, A242512, A242513, A242514, A183043. %K A242591 easy,nonn,walk,tabl %O A242591 0,2 %A A242591 _Fred Lunnon_, May 18 2014 %E A242591 a(66) ff. exported to b-file by _Georg Fischer_, Jul 16 2020