OFFSET
1,3
FORMULA
G.f.: Sum_{k>=2} Fibonacci(k)*x^Fibonacci(k)/(1 + x^Fibonacci(k)).
a(n) = n + 1 if n is an odd prime Fibonacci number (A005478 except a(1) = 2).
EXAMPLE
L.g.f.: L(x) = x + x^2/2 + 4*x^3/3 - 3*x^4/4 + 6*x^5/5 - 2*x^6/6 + x^7/7 + 5*x^8/8 + 4*x^9/9 - 4*x^10/10 + ...
exp(L(x)) = 1 + x + x^2 + 2*x^3 + x^4 + 2*x^5 + 2*x^6 + x^7 + 3*x^8 + 2*x^9 + 2*x^10 + ... + A000119(n)*x^n + ...
MATHEMATICA
nmax = 85; Rest[CoefficientList[Series[Log[Product[(1 + x^Fibonacci[k]), {k, 2, 14}]], {x, 0, nmax}], x] Range[0, nmax]]
nmax = 85; Rest[CoefficientList[Series[Sum[Fibonacci[k] x^Fibonacci[k]/(1 + x^Fibonacci[k]), {k, 2, 14}], {x, 0, nmax}], x]]
Table[DivisorSum[n, (-1)^(n/# + 1) # &, IntegerQ[(5 #^2 + 4)^(1/2)] || IntegerQ[(5 #^2 - 4)^(1/2)] &], {n, 85}]
CROSSREFS
KEYWORD
sign
AUTHOR
Ilya Gutkovskiy, Mar 14 2018
STATUS
approved