login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098812 Numbers n such that n^n + F(n) is prime, where F(k) is the k-th Fibonacci number. 0
1, 2, 3, 28 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(5)>5000
LINKS
EXAMPLE
a(2)=2: 2^2+F(2) = 4+1 = 5, which is prime.
MATHEMATICA
Do[If[PrimeQ[n^n + Fibonacci[n]], Print[n]], {n, 5000}] (* Ryan Propper, May 20 2006 *)
CROSSREFS
Sequence in context: A242520 A132533 A059089 * A073049 A349826 A279880
KEYWORD
hard,nonn,more
AUTHOR
Ray G. Opao, Oct 07 2004
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 22 06:32 EDT 2024. Contains 374481 sequences. (Running on oeis4.)