login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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; text; internal format)
OFFSET

1,1

COMMENTS

Some of the larger entries may only correspond to probable primes.

LINKS

Table of n, a(n) for n=1..8.

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 * A270550 A076977 A328833

Adjacent sequences:  A078724 A078725 A078726 * A078728 A078729 A078730

KEYWORD

nonn

AUTHOR

Neil Fernandez, Dec 20 2002

EXTENSIONS

More terms from Jack Brennen, Dec 20 2002. For additional terms see A078735.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 13:26 EST 2019. Contains 329751 sequences. (Running on oeis4.)