%I #27 Aug 20 2019 04:52:22
%S 1,2,3,7,6,21,14,50,52,122,90,427,234,784,1038,2351,1598,6860,4182,
%T 17262,17262,35622,28658,139703,90031,243308,300405,766850,514230,
%U 2367006,1346270,5188658,5326470,11409346,11782764,44717548,24157818
%N a(n) = F(n) * Sum_{k|n} 1/F(k), where F(k) is the k-th Fibonacci number.
%C a(n) = a(n+1) for n = 20, but for no other n < 25000. - _Klaus Brockhaus_, Oct 11 2005
%C If k|n then F(k)|F(n). Therefore A111075(n) = F(n) * sum{k|n} 1/F(k) = sum{k|n} F(n)/F(k) is a sum of integers. - _Max Alekseyev_, Oct 22 2005
%H Alois P. Heinz, <a href="/A111075/b111075.txt">Table of n, a(n) for n = 1..4785</a>
%F G.f.: Sum_{n>=1} x^n/(1 - Lucas(n)*x^n + (-1)^n*x^(2*n)) where Lucas(n) = A000204(n). [_Paul D. Hanna_, Jan 09 2012]
%e a(6) = F(6) sum{k|6} 1/F(k) = F(6) * (1/F(1) + 1/F(2) + 1/F(3) + 1/F(6)) = 8 * (1/1 + 1/1 + 1/2 + 1/8) = 21.
%p with(combinat): with(numtheory): a:=proc(n) local div: div:=divisors(n): fibonacci(n)*sum(1/fibonacci(div[j]),j=1..tau(n)) end: seq(a(n),n=1..40); # _Emeric Deutsch_, Oct 11 2005
%p # second Maple program:
%p a:= n-> (F-> F(n)*add(1/F(d),d=numtheory[divisors(n)))(
%p combinat[fibonacci]):
%p seq(a(n), n=1..42); # _Alois P. Heinz_, Aug 20 2019
%t f[n_] := Fibonacci[n]*Plus @@ (1/Fibonacci /@ Divisors[n]); Table[ f[n], {n, 37}] (* _Robert G. Wilson v_, Oct 11 2005 *)
%o (PARI) {for(n=1,37,d=divisors(n);print1(fibonacci(n)*sum(j=1,length(d), 1/fibonacci(d[j])),","))}
%o (PARI) {a(n)=fibonacci(n) * sumdiv(n,d, 1/fibonacci(d))} /* _Paul D. Hanna_, Oct 11 2005 */
%o (PARI) {Lucas(n)=fibonacci(n-1)+fibonacci(n+1)}
%o {a(n)=polcoeff(sum(m=1,n, x^m/(1 - Lucas(m)*x^m + (-1)^m*x^(2*m) +x*O(x^n))),n)} /* _Paul D. Hanna_, Oct 11 2005 */
%Y Cf. A000045, A007435, A111159, A000204 (Lucas), A203318.
%K nonn
%O 1,2
%A _Leroy Quet_, Oct 10 2005
%E More terms from _Robert G. Wilson v_, _Emeric Deutsch_, _Paul D. Hanna_ and _Klaus Brockhaus_, Oct 11 2005
|