login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A337167 a(n) = 1 + 3 * Sum_{k=0..n-1} a(k) * a(n-k-1). 7

%I #36 Feb 14 2021 08:18:41

%S 1,4,25,199,1795,17422,177463,1870960,20241403,223438852,2506596547,

%T 28494103183,327507800725,3799735202218,44440058006593,

%U 523388751658831,6201937444137619,73888034816382820,884517283667145259,10634234680321209373,128347834921058404249

%N a(n) = 1 + 3 * Sum_{k=0..n-1} a(k) * a(n-k-1).

%C Binomial transform of A005159.

%H Seiichi Manyama, <a href="/A337167/b337167.txt">Table of n, a(n) for n = 0..901</a>

%H N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>

%F G.f. A(x) satisfies: A(x) = 1 / (1 - x) + 3*x*A(x)^2.

%F G.f.: (1 - sqrt(1 - 12*x / (1 - x))) / (6*x).

%F E.g.f.: exp(7*x) * (BesselI(0,6*x) - BesselI(1,6*x)).

%F a(n) = Sum_{k=0..n} binomial(n,k) * 3^k * Catalan(k).

%F a(n) = 2F1([1/2, -n], [2], -12), where 2F1 is the hypergeometric function.

%F D-finite with recurrence (n+1) * a(n) = 2 * (7*n-3) * a(n-1) - 13 * (n-1) * a(n-2) for n > 1. - _Seiichi Manyama_, Jan 31 2021

%F a(n) ~ 13^(n + 3/2) / (8 * 3^(3/2) * sqrt(Pi) * n^(3/2)). - _Vaclav Kotesovec_, Feb 14 2021

%t a[n_] := a[n] = 1 + 3 Sum[a[k] a[n - k - 1], {k, 0, n - 1}]; Table[a[n], {n, 0, 20}]

%t Table[Sum[Binomial[n, k] 3^k CatalanNumber[k], {k, 0, n}], {n, 0, 20}]

%t Table[Hypergeometric2F1[1/2, -n, 2, -12], {n, 0, 20}]

%o (PARI) {a(n) = sum(k=0, n, 3^k*binomial(n, k)*(2*k)!/(k!*(k+1)!))} \\ _Seiichi Manyama_, Jan 31 2021

%o (PARI) my(N=20, x='x+O('x^N)); Vec(2/(1-x+sqrt((1-x)*(1-13*x)))) \\ _Seiichi Manyama_, Feb 01 2021

%Y Column k=3 of A340968.

%Y Cf. A000108, A005159, A007317, A162326, A337169, A338979.

%K nonn

%O 0,2

%A _Ilya Gutkovskiy_, Jan 28 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 10:42 EDT 2024. Contains 371967 sequences. (Running on oeis4.)