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

Offset

1,1

Links

Table of n, a(n) for n=1..82.

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

Prog

(PARI) a(n)=(-1)^bigomega(fibonacci(n)) \\ Charles R Greathouse IV, Jun 13 2013

Crossrefs

Cf. A000045 A007421, A002819.

Sequence in context: A034947 A097807 A014077 * A339265 A181432 A165326

Adjacent sequences: A174348 A174349 A174350 * A174352 A174353 A174354

Keyword

sign,less

Author

Michel Lagneau, Mar 16 2010

Extensions

Examples edited by Harvey P. Dale, Dec 02 2022

Status

approved