|
Search: id:A098812
|
|
|
| A098812 |
|
Numbers n such that n^n + F(n) is prime, where F(k) is the k-th Fibonacci number. |
|
+0
1
|
| |
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(5)>5000
|
|
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 (rpropper(AT)stanford.edu), May 20 2006
|
|
CROSSREFS
|
Sequence in context: A126655 A132533 A059089 this_sequence A037320 A010344 A037316
Adjacent sequences: A098809 A098810 A098811 this_sequence A098813 A098814 A098815
|
|
KEYWORD
|
hard,nonn,more
|
|
AUTHOR
|
Ray G. Opao (1260(AT)email.com), Oct 07 2004
|
|
|
Search completed in 0.002 seconds
|
