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 A227716 #12 Jan 12 2019 11:12:50 %S A227716 2,10,8,74,56,32,518,464,288,128,3934,3520,2656,1408,512,29914,27768, %T A227716 21920,14336,6656,2048,232094,217316,181456,128256,74240,30720,8192, %U A227716 1812890,1719616,1475172,1118592,716288,372736,139264,32768,14277886,13633972,11989800,9480048 %N A227716 Triangle read by rows: Number of (2n+1)-step self-avoiding walks on diamond lattice ending at point with x = 2k+1. %C A227716 The number of walks ending with x = -k is the same as the number ending with x = k. %H A227716 Bert Dobbelaere, <a href="/A227716/b227716.txt">Table of n, a(n) for n = 0..135</a> (terms 0..77 from Joseph Myers) %H A227716 J. L. Martin, <a href="http://dx.doi.org/10.1017/S0305004100036240">The exact enumeration of self-avoiding walks on a lattice</a>, Proc. Camb. Phil. Soc., 58 (1962), 92-101. %e A227716 Initial rows (paths of length 1, 3, 5, ...): %e A227716 { 2 }; %e A227716 { 10, 8 }; %e A227716 { 74, 56, 32 }; %e A227716 { 518, 464, 288, 128 }. %Y A227716 Cf. A001394, A001395, A001396, A001397, A001398, A227715. %K A227716 nonn,walk,tabl %O A227716 0,1 %A A227716 _Joseph Myers_, Jul 21 2013