OFFSET
0,7
COMMENTS
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.
LINKS
Colin Barker, Table of n, a(n) for n = 0..1000
Ran Pan, Jeffrey B. Remmel, Paired patterns in lattice paths, arXiv:1601.07988 [math.CO], 2016.
Index entries for linear recurrences with constant coefficients, signature (10,-40,80,-80,32).
FORMULA
G.f.: 2*x^6*(4-10*x+7*x^2)/(1-2*x)^5.
a(n) = 2^(n-10)*(n-5)*(n-4)*(n^2+3*n+10) for n>3. - Colin Barker, Feb 08 2016
MATHEMATICA
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 *)
PROG
(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
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Ran Pan, Feb 08 2016
STATUS
approved