a(n) = smallest prime >a(n-1) such that sum of first n terms is Fib no.

Neil Fernandez primeness at borve.demon.co.uk
Fri Dec 20 20:18:20 CET 2002

Previous message (by thread): a(n) >= a(n-1) and sum of first n terms is prime
Next message (by thread): a(n) = smallest prime >a(n-1) such that sum of first n terms is Fib no.
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

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

Previous message (by thread): a(n) >= a(n-1) and sum of first n terms is prime
Next message (by thread): a(n) = smallest prime >a(n-1) such that sum of first n terms is Fib no.
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

More information about the SeqFan mailing list