STATUS
reviewed
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A333591
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing all changes.
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).
(history; published version)
(history; published version)
STATUS
proposed
reviewed
STATUS
editing
proposed
PROG
(Python3Python)
# f is a Python list of Fibonacci numbers
from sympy import fibonacci
f = [fibonacci(n) for n in range(200)]
if i%2 == 1:
STATUS
approved
editing
STATUS
proposed
approved
STATUS
editing
proposed
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 *)
STATUS
proposed
editing
STATUS
editing
proposed
NAME
allocated Alternate multiplying and adding Fibonacci numbers: a(0) = F(0) * F(1), for Adnan Baysaln >= 0, a(2n+1) = a(2n) + F(2n+2), a(2n+2) = a(2n+1) * F(2n+3).
DATA
0, 1, 2, 5, 25, 33, 429, 450, 15300, 15355, 1366595, 1366739, 318450187, 318450564, 194254844040, 194254845027, 310224987508119, 310224987510703, 1297050672782249243, 1297050672782256008, 14197516664274574263568, 14197516664274574281279
OFFSET
0,3
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.
PROG
(Python3)
# f is a Python list of Fibonacci numbers
def a(n):
out = f[0] * f[1]
for i in range(1, n+1):
if i%2 == 1:
out += f[i+1]
else:
out *= f[i+1]
return out
KEYWORD
allocated
nonn
AUTHOR
Adnan Baysal, Mar 27 2020
STATUS
approved
editing
NAME
allocated for Adnan Baysal
KEYWORD
allocated
STATUS
approved