%I A091090
%S A091090 1,1,1,2,1,2,1,3,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1,5,1,2,1,
%T A091090 3,1,2,1,4,1,2,1,3,1,2,1,5,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1,6,1,2,1,3,1,2,
%U A091090 1,4,1,2,1,3,1,2,1,5,1,2,1,3,1,2,1,4,1,2,1,3,1,2,1,6,1,2,1,3,1,2
%N A091090 In binary representation: number of editing steps (delete, insert, or 
               substitute) to transform n into n+1.
%C A091090 a(n) = A007814(n+1) + 1 - A036987(n).
%C A091090 a(n) = A152487(n+1,n). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), 
               Dec 06 2008]
%H A091090 Michael Gilleland, <a href="http://www.merriampark.com/ld.htm">Levenshtein 
               Distance</a> [It has been suggested that this algorithm gives incorrect 
               results sometimes. - N. J. A. Sloane (njas(AT)research.att.com)]
%H A091090 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               Binary.html">Binary</a>
%H A091090 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               BinaryCarrySequence.html">Binary Carry Sequence</a>
%H A091090 <a href="Sindx_Bi.html#binary">Index entries for sequences related to 
               binary expansion of n</a>
%F A091090 LevenshteinDistance(A007088(n), A007088(n+1)).
%F A091090 a(2*n)=1, a(2*n+1)=a(n)+1. G.f.: Sum_{k>0} x^(2^k-1)/(1-x^(2^(k-1))). 
               - Vladeta Jovovic (vladeta(AT)eunet.rs), Aug 25 2004
%Y A091090 Cf. A007088.
%Y A091090 This is Guy Steele's sequence GS(2, 4) (see A135416).
%Y A091090 Sequence in context: A055874 A161506 A066451 this_sequence A066075 A072347 
               A136107
%Y A091090 Adjacent sequences: A091087 A091088 A091089 this_sequence A091091 A091092 
               A091093
%K A091090 nonn,base
%O A091090 0,4
%A A091090 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 19 2003