[math-fun] Re: a(n) = smallest prime >a(n-1) such that sum of first n terms is Fib no.

I think that I have upped this to 10^64, and someone who knew how to sieve could probably go much further. It's a probably fruitless task, but one admits to being tantalized by u_n - u_37 = 919p for n = 144 5p 234 79p 264 9349p 306 Of course, those pees are industrial strength, but there's no doubt that the small factors are OK. R. On Fri, 20 Dec 2002, Neil Fernandez wrote:

2,3,29,199,2351,24155233, next term >10^15

a(n) = smallest prime > a(n-1) such that sum of first n terms is a Fibonacci number

a(7), if it exists, > 10^15

Neil -- Neil Fernandez