A174340 a(n) = mu(Fibonacci(n)), where mu is the Moebius function A008683, n >=1.

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, -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, -1, -1, 1, 0, 1, -1, -1, 1, -1, 0, -1, -1, -1, -1, 1, 0, 1, 1, 0, -1, 1

Offset

1,1

Links

Amiram Eldar, Table of n, a(n) for n = 1..1408

Example

mu(Fibonacci(1))= mu(Fibonacci(2))= mu(1)= 1;
mu(Fibonacci(3))= mu(2) = -1;
mu(Fibonacci(4))= mu(3)= -1;
mu(Fibonacci(5))= mu(5)= -1;
mu(Fibonacci(6)) = mu(8) = 0.

Maple

A174340 := proc(n)
        numtheory[mobius](combinat[fibonacci](n)) ;
end proc: # R. J. Mathar, Jul 11 2012

Mathematica

MoebiusMu[Fibonacci[Range[80]]] (* Harvey P. Dale, Nov 16 2014 *)

Crossrefs

Cf. A000045.

Sequence in context: A356173 A294934 A360128 * A300294 A071041 A082551

Adjacent sequences: A174337 A174338 A174339 * A174341 A174342 A174343

Keyword

sign

Author

Michel Lagneau, Mar 16 2010

Status

approved