close
login
A095734
Asymmetricity-index for Zeckendorf-expansion A014417(n) of n.
2
0, 0, 1, 1, 0, 1, 0, 2, 1, 0, 2, 1, 0, 1, 0, 2, 2, 1, 2, 1, 3, 1, 0, 2, 2, 1, 1, 0, 2, 2, 1, 3, 1, 0, 1, 0, 2, 2, 1, 2, 1, 3, 2, 1, 3, 3, 2, 2, 1, 3, 1, 0, 3, 2, 4, 1, 0, 2, 2, 1, 2, 1, 3, 1, 0, 2, 2, 1, 2, 1, 3, 3, 2, 1, 0, 2, 2, 1, 3, 1, 0, 3, 2, 4, 2, 1, 3, 1, 0, 1, 0, 2, 2, 1, 2, 1, 3, 2, 1, 3, 3, 2, 2, 1, 3
OFFSET
0,8
COMMENTS
Least number of flips of "fibits" (changing either 0 to 1 or 1 to 0 in Zeckendorf-expansion A014417(n)) so that a palindrome is produced.
EXAMPLE
The integers 0 and 1 look as '0' and '1' also in Fibonacci-representation,
and being palindromes, a(0) and a(1) = 0.
2 has Fibonacci-representation '10', which needs a flip of other 'fibit',
that it would become a palindrome, thus a(2) = 1. Similarly 3 has representation
'100', so flipping for example the least significant fibit, we get '101',
thus a(3)=1 as well. 7 (= F(3)+F(5)) has representation '1010', which needs
two flips to produce a palindrome, thus a(7)=2. Here F(n) = A000045(n).
CROSSREFS
a(n) = A037888(A003714(n)). A094202 gives the positions of zeros. Cf. also A095732.
Sequence in context: A208664 A030200 A287072 * A137269 A343348 A112201
KEYWORD
base,nonn
AUTHOR
Antti Karttunen, Jun 05 2004
STATUS
approved