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 A151471 #20 Dec 04 2016 13:57:03 %S A151471 1,5,70,1335,29722,726726,18924180,515622393,14537063970,420926828322, %T A151471 12451967363004,374889010764450,11453678709964092,354319982375393300, %U A151471 11078755353095301720,349637888810064314295,11124472891130365079250,356502250246211571438090 %N A151471 Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of 2 n steps taken from {(-1, -1), (-1, 0), (-1, 1), (1, -1), (1, 0), (1, 1)}. %H A151471 M. Bousquet-Mélou and M. Mishna, <a href="http://arxiv.org/abs/0810.4387">Walks with small steps in the quarter plane</a>, ArXiv 0810.4387, 2008. %F A151471 a(n) = ((1-n)*A026945(n)+(n+2)*A026945(n+1)) * (n+2)*binomial(2*n+3,n+1)/(3*(4*n+2)*(4*n+5)). [_Mark van Hoeij_, Jul 14 2010] %p A151471 G := Int(Int(2*((12*t^2+1)*hypergeom([1/4, 3/4],[1],64*t^2/(12*t^2+1)^2) %p A151471 -12*t^2*hypergeom([3/4,5/4],[2],64*t^2/(12*t^2+1)^2))/((1-36*t^2)*(12*t^2+1)^(3/2)),t),t)/t^2; %p A151471 ogf := subs(t=x^(1/2), series(G, t=0, 40)); # _Mark van Hoeij_, Aug 20 2014 %t A151471 aux[i_Integer, j_Integer, n_Integer] := Which[Min[i, j, n] < 0 || Max[i, j] > n, 0, n == 0, KroneckerDelta[i, j, n], True, aux[i, j, n] = aux[-1 + i, -1 + j, -1 + n] + aux[-1 + i, j, -1 + n] + aux[-1 + i, 1 + j, -1 + n] + aux[1 + i, -1 + j, -1 + n] + aux[1 + i, j, -1 + n] + aux[1 + i, 1 + j, -1 + n]]; Table[Sum[aux[0, k, 2 n], {k, 0, 2 n}], {n, 0, 25}] %K A151471 nonn,walk %O A151471 0,2 %A A151471 _Manuel Kauers_, Nov 18 2008