OFFSET
0,2
COMMENTS
See Dziemianczuk (2014) for precise definition.
LINKS
Lars Blomberg, Table of n, a(n) for n = 0..100
M. Dziemianczuk, On Directed Lattice Paths With Additional Vertical Steps, arXiv preprint arXiv:1410.5747 [math.CO], 2014.
FORMULA
G.f.: P0(x) = 1/(1-x-x*P1(x)), where P1(x) = 2*(1-x)/(3*x) - 2*(sqrt(1-5*x-2*x^2)/(3*x))*sin(Pi/6 + arccos((20*x^3-6*x^2+15*x-2)/(2*(1-5*x-2*x^2)^(3/2)))/3). - See Dziemianczuk (2014), Proposition 11.
a(n) = Sum_{m=0..n+1} ((-1)^(n-m+1)*binomial(n+1,m) * Sum_{i=m..n+m} (binomial(i-1,i-m) * Sum_{j=0..n-m+1} (binomial(j,n+m-j-i)*2^(-n+m+2*j+i)*3^(n-m-j+1)*binomial(n-m+1,j))))/(n+1). - Vladimir Kruchinin, Feb 28 2016
a(n) ~ c * (22 + 10*sqrt(5))^(n/2) / n^(3/2), where c = 1/sqrt((5/2 - sqrt(5) + sqrt(85*sqrt(5)-190))*Pi) = 0.7820861193303307654051... . - Vaclav Kotesovec, Feb 28 2016
MATHEMATICA
Table[Sum[(-1)^(n-l+1)*Binomial[n+1, l] * Sum[Binomial[i-1, i-l] * Sum[Binomial[j, n+l-j-i] * 2^(-n+l+2*j+i) * 3^(n-l-j+1) * Binomial[n-l+1, j], {j, 0, n-l+1}], {i, l, n+l}], {l, 0, n+1}]/(n+1), {n, 0, 20}] (* Vaclav Kotesovec, Feb 28 2016, after Vladimir Kruchinin *)
PROG
(Maxima) a(n):=sum((-1)^(n-l+1)*binomial(n+1, l)*sum(binomial(i-1, i-l)*sum(binomial(j, n+l-j-i)*2^(-n+l+2*j+i)*3^(n-l-j+1)*binomial(n-l+1, j), j, 0, n-l+1), i, l, n+l), l, 0, n+1)/(n+1); /* Vladimir Kruchinin, Feb 28 2016 */
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jul 30 2015
EXTENSIONS
More terms from Lars Blomberg, Aug 01 2015
STATUS
approved