|
Search: id:A078742
|
|
|
| A078742 |
|
a(n) = smallest Fibonacci number > a(n-1) such that a(1) + ... + a(n) is prime. |
|
+0
2
|
| |
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(7), if it exists, > 10^15
|
|
EXAMPLE
|
a(1)=2, the smallest Fibonacci number to be prime. The smallest Fibonacci number >2 that yields a prime when added to 2 is 3, so a(2)=3. The smallest Fibonacci number > 3 that yields a prime when added to 2+3 is 8 so a(3)=8.
|
|
CROSSREFS
|
Cf. A000045, A078727, A078743.
Sequence in context: A162052 A082569 A084908 this_sequence A005370 A112866 A041657
Adjacent sequences: A078739 A078740 A078741 this_sequence A078743 A078744 A078745
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. Fernandez (primeness(AT)borve.org), Dec 21 2002
|
|
|
Search completed in 0.002 seconds
|
