login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

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

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

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 A279880 A279140

Adjacent sequences:  A098809 A098810 A098811 * A098813 A098814 A098815

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 20:40 EST 2021. Contains 349589 sequences. (Running on oeis4.)