close
login
A174351
a(n) = lambda(Fibonacci(n)).
1
1, 1, -1, -1, -1, -1, -1, 1, 1, 1, -1, 1, -1, 1, -1, -1, -1, -1, 1, 1, -1, 1, -1, -1, -1, 1, 1, 1, -1, -1, 1, 1, -1, 1, -1, 1, -1, -1, -1, 1, 1, -1, -1, -1, -1, -1, -1, 1, -1, 1, -1, 1, 1, 1, 1, -1, -1, -1, 1, 1, 1, -1, -1, 1, -1, -1, -1, -1, -1, -1, 1, 1, 1, 1, 1, -1, 1, 1, 1, -1, -1, -1
OFFSET
1,1
FORMULA
a(n) = A008836(A000045(n)).
EXAMPLE
L(Fibonacci(1)) = L(Fibonacci(2)) = L(1) = 1.
L(Fibonacci(3)) = L(2) = -1.
L(Fibonacci(12)) = L(144) = 1.
MAPLE
A174351 := proc(n)
A008836(combinat[fibonacci](n)) ;
end proc: # R. J. Mathar, Jul 08 2012
MATHEMATICA
Table[LiouvilleLambda[Fibonacci[n]], {n, 100}] (* Wesley Ivan Hurt, Jan 06 2026 *)
PROG
(PARI) a(n)=(-1)^bigomega(fibonacci(n)) \\ Charles R Greathouse IV, Jun 13 2013
CROSSREFS
KEYWORD
sign,less
AUTHOR
Michel Lagneau, Mar 16 2010
EXTENSIONS
Examples edited by Harvey P. Dale, Dec 02 2022
STATUS
approved