OFFSET
1,1
COMMENTS
Damir et al. conjecture that this sequence is finite.
LINKS
Mohamed Taoufiq Damir, Bernadette Faye, Florian Luca, and Amadou Tall, Fibonacci numbers with prime sums of complementary divisors, Integers 14 (2014), A5.
MATHEMATICA
f2[n_] := Module[{d = Rest[Most[Divisors[n]]]}, n/d + d]; Select[Range[3, 200], And @@ PrimeQ[f2[Fibonacci[#]]] &]
PROG
(PARI) is(n)=my(F=fibonacci(n)); if(n%6==0 || n%25==0 || n%56==0 || n%91==0 || n%110==0 || n%153==0 || !issquarefree(F), return(0)); fordiv(F, d, if(d>1 && d<F && !isprime(F/d+d), return(0))); 1 \\ Charles R Greathouse IV, Feb 04 2014
CROSSREFS
KEYWORD
nonn,more
AUTHOR
T. D. Noe, Jan 31 2014
EXTENSIONS
a(18)-a(24) from Charles R Greathouse IV, Feb 04 2014
Terms 2971 to 9677 from Don Reble. - N. J. A. Sloane, Nov 04 2022
STATUS
approved