The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A333591 Alternate multiplying and adding Fibonacci numbers: a(0) = F(0) * F(1), for n >= 0, a(2n+1) = a(2n) + F(2n+2), a(2n+2) = a(2n+1) * F(2n+3). 0
 0, 1, 2, 5, 25, 33, 429, 450, 15300, 15355, 1366595, 1366739, 318450187, 318450564, 194254844040, 194254845027, 310224987508119, 310224987510703, 1297050672782249243, 1297050672782256008, 14197516664274574263568, 14197516664274574281279 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS EXAMPLE a(0) = 0 * 1 =  0; a(1) = 0 + 1 =  1; a(2) = 1 * 2 =  2; a(3) = 2 + 3 =  5; a(4) = 5 * 5 = 25. MATHEMATICA a[0] = 0; a[n_] := a[n] = If[EvenQ[n], a[n-1] * Fibonacci[n+1], a[n-1] + Fibonacci[n+1]]; Array[a, 22, 0] (* Amiram Eldar, Mar 28 2020 *) PROG (Python) from sympy import fibonacci f = [fibonacci(n) for n in range(200)] def a(n):     out = f[0] * f[1]     for i in range(1, n+1):         if i%2:             out += f[i+1]         else:             out *= f[i+1]     return out CROSSREFS Cf. A000045, A047904, A047905, A077138, A222559, A332657, A332659. Sequence in context: A000895 A109306 A009560 * A079434 A220170 A273238 Adjacent sequences:  A333588 A333589 A333590 * A333592 A333593 A333594 KEYWORD nonn AUTHOR Adnan Baysal, Mar 27 2020 STATUS approved

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

Last modified January 18 13:24 EST 2021. Contains 340254 sequences. (Running on oeis4.)