|
|
A111136
|
|
a(n) = Sum_{k=1..n} Fibonacci(prime(k)).
|
|
2
|
|
|
1, 3, 8, 21, 110, 343, 1940, 6121, 34778, 549007, 1895276, 26053093, 191633234, 625127671, 3596342744, 56912633917, 1013634659958, 3518365441919, 48463935654772, 356525456824901, 1163040989874294, 15635375014550515, 114830228109306012, 1894809644114020201
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
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
|
# second Maple program:
a:= proc(n) option remember; `if`(n=0, 0, a(n-1)+
(<<0|1>, <1|1>>^ithprime(n))[1, 2])
end:
|
|
MATHEMATICA
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|