|
|
A078743
|
|
a(n) is the Fibonacci index of b(n) in the sequence b(1), b(2), ... where b(n) is the smallest Fibonacci number > b(n-1) such that b(1) + ... + b(n) is prime.
|
|
1
|
|
|
3, 4, 6, 9, 12, 24, 78, 108, 114, 213, 576, 1674, 1773, 1920, 2916, 23439, 24606
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
The smallest Fibonacci number to be prime is 2, the 3rd Fibonacci number, so a(1)=3. The smallest Fibonacci number >2 that yields a prime when added to 2 is 3, the 4th Fibonacci number, so a(2)=4. The smallest Fibonacci number >3 that yields a prime when added to 2+3 is 8, the 4th Fibonacci number, so a(3)=6.
|
|
MAPLE
|
N:= 16; # to get the first N terms
fib:= combinat[fibonacci]:
a[1]:= 3: s:= fib(3): count:= 1:
for i from 4 while count < N do
if isprime(s+fib(i)) then
count:= count+1;
a[count]:= i;
s:= s + fib(i);
fi
od:
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|