OFFSET
1,1
COMMENTS
Primes in this sequence include a(1) = 3, a(2) = 7, a(4) = 19, a(6) = 43, a(8) = 83. Because the underlying sequence is hard, so is this, and so it is hard to determine if there is ever another such prime sum of indices of prime Fibonacci numbers.
EXAMPLE
a(20) = 3 + 4 + 5 + 7 + 11 + 13 + 17 + 23 + 29 + 43 + 47 + 83 + 131 + 137 + 359 + 431 + 433 + 449 + 509 + 569 = 3303.
CROSSREFS
KEYWORD
hard,nonn
AUTHOR
Jonathan Vos Post, Jan 25 2010
STATUS
approved