This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A095734 #2 Mar 31 2012 14:02:28 %S A095734 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, %T A095734 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, %U A095734 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 %N A095734 Asymmetricity-index for Zeckendorf-expansion A014417(n) of n. %C A095734 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. %e A095734 The integers 0 and 1 look as '0' and '1' also in Fibonacci-representation, %e A095734 and being palindromes, a(0) and a(1) = 0. %e A095734 2 has Fibonacci-representation '10', which needs a flip of other 'fibit', %e A095734 that it would become a palindrome, thus a(2) = 1. Similarly 3 has representation %e A095734 '100', so flipping for example the least significant fibit, we get '101', %e A095734 thus a(3)=1 as well. 7 (= F(3)+F(5)) has representation '1010', which needs %e A095734 two flips to produce a palindrome, thus a(7)=2. Here F(n) = A000045(n). %Y A095734 a(n) = A037888(A003714(n)). A094202 gives the positions of zeros. Cf. also A095732. %K A095734 base,nonn %O A095734 0,8 %A A095734 _Antti Karttunen_, Jun 05 2004