OFFSET
1,6
COMMENTS
LINKS
T. D. Noe, Table of n, a(n) for n = 1..1000 (using Blair Kelly's data)
Blair Kelly, Fibonacci and Lucas Factorizations
Eric Weisstein's World of Mathematics, Lucas Number
FORMULA
a(n) = Sum{d|n and n/d odd} A086600(d) + 1 if 6|n, a Mobius-like transform
MATHEMATICA
Lucas[n_] := Fibonacci[n+1] + Fibonacci[n-1]; Table[Length[FactorInteger[Lucas[n]]], {n, 150}]
PROG
(PARI) a(n)=omega(fibonacci(n-1)+fibonacci(n+1)) \\ Charles R Greathouse IV, Sep 14 2015
(Magma) [#PrimeDivisors(Lucas(n)): n in [1..100]]; // Vincenzo Librandi, Jul 26 2017
CROSSREFS
KEYWORD
hard,nonn
AUTHOR
T. D. Noe, Jul 24 2003
STATUS
approved