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!)
A289068 Recurrence a(n+2) = Sum_{k=0..n} binomial(n,k)*a(k)*a(n+1-k) with a(0)=1, a(1)=-2. 15

%I #23 Apr 18 2020 09:20:44

%S 1,-2,-2,2,14,10,-170,-670,2270,30490,26950,-1435150,-8513650,

%T 59564650,1050090550,486517250,-113618013250,-831340535750,

%U 10136160835750,208459859695250,-121723298991250,-41568491959973750,-338549875950886250,6637158567781561250

%N Recurrence a(n+2) = Sum_{k=0..n} binomial(n,k)*a(k)*a(n+1-k) with a(0)=1, a(1)=-2.

%C One of a family of integer sequences whose e.g.f.s satisfy the differential equation f''(z) = f'(z)f(z). For more details, see A289064.

%H Stanislav Sykora, <a href="/A289068/b289068.txt">Table of n, a(n) for n = 0..200</a>

%H Stanislav Sykora, <a href="http://dx.doi.org/10.3247/SL6Math17.001">Sequences related to the differential equation f'' = af'f</a>, Stan's Library, Vol. VI, Jun 2017.

%F E.g.f.: -sqrt(5)*tanh(z*sqrt(5)/2 - arccosh(sqrt(5)/2)).

%F E.g.f. for the sequence (-1)^(n+1)*a(n): -sqrt(5)*tanh(z*sqrt(5)/2 + arccosh(sqrt(5)/2)).

%o (PARI) c0=1;c1=-2;nmax = 200;

%o a=vector(nmax+1);a[1]=c0;a[2]=c1;

%o for(m=0,#a-3,a[m+3]=sum(k=0,m,binomial(m,k)*a[k+1]*a[m+2-k]));

%o a

%o (Python)

%o from sympy import binomial

%o l=[1, -2]

%o for n in range(2, 51): l+=[sum([binomial(n - 2, k)*l[k]*l[n - 1 - k] for k in range(n - 1)]), ]

%o print(l) # _Indranil Ghosh_, Jun 30 2017

%Y Sequences for other starting pairs: A000111 (1,1), A289064 (1,-1), A289065 (2,-1), A289066 (3,1), A289067 (3,-1), A289069 (3,-2), A289070 (0,3).

%K sign

%O 0,2

%A _Stanislav Sykora_, Jun 23 2017

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 March 29 10:59 EDT 2024. Contains 371277 sequences. (Running on oeis4.)