OFFSET
1,2
FORMULA
EXAMPLE
The first 3 primes are 2, 3 and 5. So a(3) = F(2)+F(3)+F(5) = 1+2+5 = 8.
MAPLE
with(numtheory); with(combinat); A111136:=n->sum(fibonacci(ithprime(i)), i=1..n); seq(A111136(n), n=1..30); # Wesley Ivan Hurt, Feb 02 2014
# second Maple program:
a:= proc(n) option remember; `if`(n=0, 0, a(n-1)+
(<<0|1>, <1|1>>^ithprime(n))[1, 2])
end:
seq(a(n), n=1..25); # Alois P. Heinz, Jun 24 2022
MATHEMATICA
f[n_] := Sum[ Fibonacci[ Prime[i]], {i, n}]; Array[f, 22] (* Robert G. Wilson v *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Leroy Quet, Oct 17 2005
EXTENSIONS
More terms from Robert G. Wilson v, Oct 21 2005
STATUS
approved