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 A268599 #16 Feb 08 2016 11:05:47
%S A268599 0,0,0,0,0,0,8,60,294,1180,4200,13776,42560,125568,357120,985600,
%T A268599 2652672,6988800,18077696,46018560,115507200,286326784,701890560,
%U A268599 1703411712,4096655360,9771417600,23132110848,54384394240,127049662464,295069286400,681574400000
%N A268599 Expansion of 2*x^6*(4-10*x+7*x^2)/(1-2*x)^5.
%C A268599 a(n) is the number of North-East lattice paths from (0,0) to (n,n) that have exactly two east steps below y = x - 1 and exactly two easts step above y = x + 1. Details can be found in Section 4.1 in Pan and Remmel's link.
%H A268599 Colin Barker, <a href="/A268599/b268599.txt">Table of n, a(n) for n = 0..1000</a>
%H A268599 Ran Pan, Jeffrey B. Remmel, <a href="http://arxiv.org/abs/1601.07988">Paired patterns in lattice paths</a>, arXiv:1601.07988 [math.CO], 2016.
%H A268599 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (10,-40,80,-80,32).
%F A268599 G.f.: 2*x^6*(4-10*x+7*x^2)/(1-2*x)^5.
%F A268599 a(n) = 2^(n-10)*(n-5)*(n-4)*(n^2+3*n+10) for n>3. - _Colin Barker_, Feb 08 2016
%t A268599 CoefficientList[Series[2 x^6 (4 - 10 x + 7 x^2)/(1 - 2 x)^5, {x, 0, 30}], x] (* _Michael De Vlieger_, Feb 08 2016 *)
%o A268599 (PARI) concat(vector(6), Vec(2*x^6*(4-10*x+7*x^2)/(1-2*x)^5 + O(x^100))) \\ _Colin Barker_, Feb 08 2016
%Y A268599 Cf. A268462, A268586, A268587, A268598.
%K A268599 nonn,easy
%O A268599 0,7
%A A268599 _Ran Pan_, Feb 08 2016