OFFSET
5,1
COMMENTS
a(n) is the number of North-East paths from (0,0) to (n,n) that cross the diagonal vertically exactly once and horizontally exactly twice, and bounce off the diagonal to the right once but not to the left. Details about this sequence can be found in Section 4.5 in Pan and Remmel's link. - Ran Pan, Feb 01 2016
LINKS
Ran Pan and Jeffrey B. Remmel, Paired patterns in lattice paths, arXiv:1601.07988 [math.CO], 2016-2017.
FORMULA
G.f.: (1 - sqrt(1 - 4*x))^5/16.
a(n) = 10 * binomial(2n-6,n-5)/n.
From R. J. Mathar, Feb 17 2016: (Start)
a(n) = 2*A000344(n-3).
D-finite with recurrence: n*(n-5)*a(n) - 2*(n-3)*(2*n-7)*a(n-1) = 0. (End)
E.g.f.: (15*(2 - 10*x + 5*x^2) + 2*exp(2*x)*(16*x^3 - 128*x^2 + 105*x - 15)*BesselI(0, 2*x) - exp(2*x)*x*(32*x^2 - 248*x + 149)*BesselI(1, 2*x))/30. - Stefano Spezia, Sep 21 2025
a(n) ~ 5 * 2^(2*n-5) / (n^(3/2) * sqrt(Pi)). - Amiram Eldar, Oct 19 2025
MATHEMATICA
Table[10 Binomial[2 n - 6, n - 5]/n, {n, 5, 30}] (* or *)
Table[SeriesCoefficient[(1 - Sqrt[1 - 4 x])^5/16, {x, 0, n}], {n, 5, 30}] (* Michael De Vlieger, Feb 17 2016 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Ran Pan, Feb 01 2016
EXTENSIONS
a(30) from Stefano Spezia, Sep 21 2025
STATUS
approved
