login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A350700
a(n) is the number of 1's minus the number of 0's in A004685(n).
1
-1, 1, 1, 0, 2, 1, -2, 2, 1, -2, 4, 1, -4, 2, 3, -2, 6, 3, -4, -3, 3, -2, 1, 7, -4, -5, 1, 4, 3, 5, -4, 1, -4, 4, 1, -2, 0, 3, -6, -2, 5, 6, 0, 3, 6, -1, 11, -6, -9, 3, 2, -1, -1, -2, -5, 6, 4, -7, 8, 0, -9, -4, 10, 3, -4, 6, -7, 6, -17, -1, -2, -5, 1, 4, -3
OFFSET
0,5
LINKS
FORMULA
a(n) = A145037(A000045(n)) for n >= 1.
a(n) = 0 if and only if n is in A214852. - Amiram Eldar, Jan 22 2022
EXAMPLE
A004685(0) = 0; this term has 0 ones and 1 zero. So a(0) = 0 - 1 = -1.
A004685(7) = 1101; this term has 3 ones and 1 zero. So a(7) = 3 - 1 = 2.
MATHEMATICA
a[n_] := Subtract @@ DigitCount[Fibonacci[n], 2, {1, 0}]; Array[a, 75, 0] (* Amiram Eldar, Jan 22 2022 *)
PROG
(Python) from sympy import fibonacci
print([(bin(fibonacci(n))[2:].count("1") - bin(fibonacci(n))[2:].count("0")) for n in range (0, 100)])
CROSSREFS
KEYWORD
sign,base
AUTHOR
Karl-Heinz Hofmann, Jan 18 2022
STATUS
approved