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 A342888 #5 Mar 31 2021 13:33:35 %S A342888 1,24,552,12696,291480,6692424,153614760,3526063752,80931227016, %T A342888 1857565708968,42634594787160,978544945823832,22459264078075992, %U A342888 515478463349872200,11831064537706447464,271542137952854806776,6232321082672399260152,143041632747658763159736 %N A342888 Number of n-step self-avoiding walks on 12-D cubic lattice. %H A342888 N. Clisby, R. Liang, and G. Slade, <a href="http://dx.doi.org/10.1088/1751-8113/40/36/003">Self-avoiding walk enumeration via the lace expansion</a>, J. Phys. A: Math. Theor. vol. 40 (2007) pp. 10973-11017. Gives terms through a(24). %H A342888 Nathan Clisby, Richard Liang, and Gordon Slade, <a href="http://www.math.ubc.ca/~slade/se_tables.pdf">Self-avoiding walk enumeration via the lace expansion: tables</a> [Tables in humanly readable form]; <a href="/A342883/a342883.pdf">Local copy</a>. %H A342888 N. Clisby, R. Liang, and G. Slade, <a href="http://www.math.ubc.ca/~slade/lacecounts/">Self-avoiding walk enumeration via the lace expansion</a>. [Tables in machine-readable format on separate pages.] %Y A342888 For self-avoiding walks on the k-D cubic lattice for k = 2, ..., 12 see A001411, A001412, A010575, A010576, A010577, A342883, A342884, A342885, A342886, A342887, A342888. %K A342888 nonn %O A342888 0,2 %A A342888 _N. J. A. Sloane_, Mar 31 2021