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!)
A289086 Real parts of the recursive sequence a(n+2) = Sum_{k=0..n} binomial(n,k)*a(k)*a(n+1-k), with a(0)=1, a(1)=2i. 8
1, 0, 0, -4, -16, -44, -104, 316, 7456, 67620, 458280, 1945036, -8476496, -329703244, -4937610184, -52376610724, -339229127104, 1480668009540, 98702565516360, 2094684947562476, 30513682733622224, 275602192570387156, -985849997324785064, -115940732145525976964 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
Here, i is the imaginary unit. The complex integer sequence c(n) = A289086(n) + i*A289087(n) is one of a family of sequences whose e.g.f.s satisfy the differential equation f''(z) = f'(z)f(z). For more details, see A289064 and A289082.
LINKS
S. Sykora, Sequences related to the differential equation f'' = af'f, Stan's Library, Vol. VI, Jun 2017.
FORMULA
E.g.f.: real(2*L0*tan(L0*z + L1)), where L0 = sqrt(i-1/4) and L1 = arccos(sqrt(1+i/4)).
MATHEMATICA
a[0]=1; a[1]=2I; a[n_]:=a[n]=Sum[Binomial[n - 2, k] a[k] a[n - 1 - k], {k, 0, n - 2}]; Re[Table[a[n], {n, 0, 50}]] (* Indranil Ghosh, Jul 20 2017 *)
PROG
(PARI) c0=1; c1=2*I; nmax = 200;
a=vector(nmax+1); a[1]=c0; a[2]=c1;
for(m=0, #a-3, a[m+3]=sum(k=0, m, binomial(m, k)*a[k+1]*a[m+2-k]));
real(a)
CROSSREFS
Cf. A289087 (imaginary part).
Sequences for other starting pairs: A000111 (1,1), A289064 (1,-1), A289065 (2,-1), A289066 (3,1), A289067 (3,-1), A289068 (1,-2), A289069 (3,-2), A289070 (0,3), A289082 and A289083 (1,i), A289084 and A289085 (2,i), A289088 and A289089 (2,2i).
Sequence in context: A259013 A212960 A217873 * A018210 A054498 A360278
KEYWORD
sign
AUTHOR
Stanislav Sykora, Jul 19 2017
STATUS
approved

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 05:56 EDT 2024. Contains 371964 sequences. (Running on oeis4.)