cp's OEIS Frontend

a(n) = Sum_{k=0..n} C(n,k)/(n-k+1) * C(n+2*k-1,n-k).

Let A(x)^m = Sum_{n>=0} a(n,m)*x^n then

a(n,m) = Sum_{k=0..n} C(n+m-1,k)*m/(n-k+m) * C(n+2*k-1,n-k).

G.f.: A(x) = (1/x)*serreverse[x/(1 + x/(1 - x)^3)].

Recurrence: 3*(n+1)*(3*n - 2)*(3*n + 2)*(2145*n^4 - 14355*n^3 + 33844*n^2 - 32668*n + 10380)*a(n) = 3*(115830*n^7 - 833085*n^6 + 2195691*n^5 - 2521863*n^4 + 998671*n^3 + 259048*n^2 - 263292*n + 41520)*a(n-1) + 3*(n-2)*(19305*n^6 - 129195*n^5 + 315651*n^4 - 367201*n^3 + 219176*n^2 - 66584*n + 7608)*a(n-2) + 3*(n-3)*(n-2)*(64350*n^5 - 334125*n^4 + 546005*n^3 - 255608*n^2 - 71320*n + 54328)*a(n-3) - 23*(n-4)*(n-3)*(n-2)*(2145*n^4 - 5775*n^3 + 3649*n^2 + 535*n - 654)*a(n-4). - Vaclav Kotesovec, Nov 18 2017

a(n) ~ sqrt(sqrt((159 + 100*sqrt(3))/13) - 2 - 5/sqrt(3)) * (3 + 2*sqrt(3) + sqrt(153 + 100*sqrt(3))/3)^(n+1) / (sqrt(Pi) * n^(3/2) * 2^(n + 5/2)). - Vaclav Kotesovec, Nov 18 2017

a(n) = Sum_{k=0..n} (C(n,k)/(n-k+1)) * C(n+3*k-1,n-k).

a(n) ~ sqrt((1 - r*s)*(1 + 3*r*s)/(8*Pi*(8*s - 3))) / (n^(3/2) * r^(n+1)), where r = 0.139684805934917057093949761392656080860096066578... and s = 1.76437708701490464570032194388560298744432681226... are real roots of the system of equations s*(1 - r/(1 - r*s)^4) = 1, 4*r^2*s^2 = (1 - r*s)^5. - Vaclav Kotesovec, Nov 21 2018

a(n) = Sum_{k=0..n} (-1)^(n-k) * binomial(n,k) * binomial(n+4*k-1,n-k) / (n-k+1).

If g.f. satisfies A(x) = 1 + x/(1 - x*A(x))^s, then a(n) = Sum_{k=0..n} binomial(n-k+1,k) * binomial(n+(s-1)*k-1,n-k)/(n-k+1).