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 A005567 M4723 #41 Apr 13 2022 13:25:17 %S A005567 10,70,308,1092,3414,9834,26752,69784,176306,434382,1048812,2490636, %T A005567 5833006,13500754,30933368,70255008,158335434,354419190,788529700, %U A005567 1744831060,3841983110,8422163130,18387829488 %N A005567 Number of walks on square lattice. %D A005567 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %D A005567 Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992. %H A005567 R. K. Guy, <a href="/A005555/a005555.pdf">Letter to N. J. A. Sloane, May 1990</a> %H A005567 R. K. Guy, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL3/GUY/catwalks.html">Catwalks, sandsteps and Pascal pyramids</a>, J. Integer Sequences, Vol. 3 (2000), Article #00.1.6, (see Figure 6). %H A005567 Simon Plouffe, <a href="https://arxiv.org/abs/0911.4975">Approximations de séries génératrices et quelques conjectures</a>, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009. %H A005567 Simon Plouffe, <a href="/A000051/a000051_2.pdf">1031 Generating Functions</a>, Appendix to Thesis, Montreal, 1992 %F A005567 a(n) = 26 + 11*n + n^2 + (-16 + 24*n + 8*n^2)*2^n. - Fitted by _John W. Layman_ %p A005567 A005567:=2*(5-10*z+4*z**2)/(2*z-1)**3/(z-1)**3; # conjectured by _Simon Plouffe_ in his 1992 dissertation %o A005567 (PARI) a(n) = 26 + 11*n + n^2 + (-16 + 24*n + 8*n^2)*2^n; \\ _Michel Marcus_, Oct 13 2014 %K A005567 nonn,walk,easy %O A005567 0,1 %A A005567 _N. J. A. Sloane_