|
%I #12 Oct 20 2019 07:23:08
%S 1,1,-1,-1,-1,0,-1,1,1,1,-1,0,-1,1,-1,-1,-1,0,1,1,-1,1,-1,0,0,1,1,1,
%T -1,0,1,1,-1,1,-1,0,-1,-1,-1,1,1,0,-1,-1,-1,-1,-1,0,-1,0,-1,1,1,0,1,0,
%U -1,-1,1,0,1,-1,-1,1,-1,0,-1,-1,-1,-1,1,0,1,1,0,-1,1
%N a(n) = mu(Fibonacci(n)), where mu is the Moebius function A008683, n >=1.
%H Amiram Eldar, <a href="/A174340/b174340.txt">Table of n, a(n) for n = 1..1408</a>
%e mu(Fibonacci(1))= mu(Fibonacci(2))= mu(1)= 1;
%e mu(Fibonacci(3))= mu(2) = -1;
%e mu(Fibonacci(4))= mu(3)= -1;
%e mu(Fibonacci(5))= mu(5)= -1;
%e mu(Fibonacci(6)) = mu(8) = 0.
%p A174340 := proc(n)
%p numtheory[mobius](combinat[fibonacci](n)) ;
%p end proc: # _R. J. Mathar_, Jul 11 2012
%t MoebiusMu[Fibonacci[Range[80]]] (* _Harvey P. Dale_, Nov 16 2014 *)
%Y Cf. A000045.
%K sign
%O 1,1
%A _Michel Lagneau_, Mar 16 2010
|
