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 A323699 #7 Jan 31 2019 08:08:19 %S A323699 1,8,56,404,2563,16516,102280,639532,3899662 %N A323699 Number of uncrossed knight's walks as specified in A323700, counting isomorphisms only once. %C A323699 First differs at a(7)=404 from A323700(7)=406, because there are two walks of length 7 trapped at both ends. If seen as unrooted walks, their path shapes become identical after path reversal and reflection. %H A323699 Hugo Pfoertner, <a href="http://www.randomwalk.de/sequences/a323699.htm">Illustrations of uncrossed knight's walks trapped after n moves</a>, (2019). %H A323699 Hugo Pfoertner, <a href="/A323699/a323699.pdf">Probability density for the number of moves to self-trapping</a>, (2019). %e A323699 In algebraic chess notation, the two walks double counted in A323700(7) are %e A323699 N c4 d2 e4 c5 a4 b2 d1 c3 and N d4 c2 e3 d5 b4 a2 c1 b3. %Y A323699 Cf. A003192, A323131, A323559, A323560, A323700. %K A323699 nonn,walk,hard,more %O A323699 4,2 %A A323699 _Hugo Pfoertner_, Jan 24 2019