OFFSET
1,2
COMMENTS
It appears that most of the terms of this sequence satisfy Fibonacci(n) == 1 (mod n). Also it seems that most of the terms are primes.
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
MATHEMATICA
Select[Range[10^4], Mod[Fibonacci[ # ], # ] == Mod[DivisorSigma[1, # ], # ] &]
PROG
(PARI) fibmod(n, m)=((Mod([1, 1; 1, 0], m))^n)[1, 2]
is(n)=fibmod(n, n)==sigma(n) \\ Charles R Greathouse IV, Nov 27 2016
CROSSREFS
KEYWORD
nonn
AUTHOR
Joseph L. Pe, Oct 17 2002
STATUS
approved