OFFSET
1,4
COMMENTS
Fibonacci(p) == L(p/5) mod p, where the Legendre symbol L(p/5) equals 0, +1, -1 according as p = 5, 5*k+-1, 5*k+-2 for some k.
Not to be confused with Fibonacci(p - L(p,5)) / p, which is A092330.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..200
Wikipedia, Prime divisors of Fibonacci numbers
FORMULA
For n>=4, a(n) = (Fibonacci(prime(n)) +/- 1)/prime(n), where '+' is chosen if prime(n)== 2 or 3 (mod 5), '-' is chosen otherwise. For n>=2, a(n) = round(Fibonacci(prime(n))/prime(n)). - Vladimir Shevelev, Mar 12 2014
EXAMPLE
Prime(4) = 7, so a(4) = (Fibonacci(7)-L(7/5))/7 = (13-(-1))/7 = 14/7 = 2.
MATHEMATICA
Table[p = Prime[n]; (Fibonacci[p] - JacobiSymbol[p, 5])/p, {n, 1, 30}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Jonathan Sondow, Feb 23 2013
STATUS
approved