|
| |
|
|
A078727
|
|
Smallest prime a(n) > a(n-1) such that a(1) + ... + a(n) is a Fibonacci number.
|
|
2
| |
|
|
2, 3, 29, 199, 2351, 24155233, 79757008057644623350300078764807923712509139103039448418553259155159833055572871, 36684474316080978061473613646275630451020829893137585191919942789652960137481051718801295569460987256072983944701335181
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Some of the larger entries may only correspond to probable primes.
|
|
|
EXAMPLE
| a(1)=2, the smallest prime to be a Fibonacci number. The smallest prime >2 that yields a Fibonacci number when added to 2 is 3, so a(2)=3. The smallest prime > 3 that yields a Fibonacci number when added to 2+3 is 29 so a(3)=29.
|
|
|
CROSSREFS
| Cf. A000045.
Sequence in context: A132282 A064893 A141514 * A076977 A109886 A127615
Adjacent sequences: A078724 A078725 A078726 * A078728 A078729 A078730
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. Fernandez (primeness(AT)borve.org), Dec 20 2002
|
|
|
EXTENSIONS
| More terms from Jack Brennen (jb(AT)brennen.net), Dec 20 2002. For additional terms see A078735.
|
| |
|
|
