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 A255062 #10 Sep 09 2017 19:26:01 %S A255062 0,1,2,4,7,12,21,37,66,119,216,394,722,1330,2464,4590,8591,16143, %T A255062 30435,57550,109115,207389,395046,754028,1441972,2762765,5303467, %U A255062 10200386,19656529,37948282,73384081,142115377,275551756,534790473,1038702981,2018626773,3924923938,7634733313 %N A255062 Number of steps to reach 0 when starting from (2^n)-1 and iterating the map x -> x - (number of runs in binary representation of x): a(n) = A255072(A000225(n)). %C A255062 Also, for n >= 1, the number of steps to reach 0 when starting from 2^n and iterating the map x -> x minus A005811(x), the number of runs in binary representation of x. %F A255062 a(n) = A255072(A000225(n)). %F A255062 a(0) = 0, a(1) = 1; for n > 1, a(n) = a(n-1) + A255071(n-1). %F A255062 Other identities. For all n >= 1: %F A255062 a(n) = A255072(A000079(n)). [See the Comments section.] %F A255062 a(n) = 1 + A255061(n). %o A255062 (Scheme) %o A255062 (define (A255062 n) (A255072 (A000225 n))) %o A255062 (define (A255062 n) (if (<= n 1) n (+ (A255062 (- n 1)) (A255071 (- n 1))))) ;; Assuming that A255071 has been already computed, with e.g. the PARI-program given in that entry. %Y A255062 One more than A255061. %Y A255062 First differences: A255071 (after the zero term). %Y A255062 Cf. A000079, A000225, A005811, A255071, A255072. %Y A255062 Analogous sequences: A213710 (A218600), A219665. %K A255062 nonn %O A255062 0,3 %A A255062 _Antti Karttunen_, Feb 14 2015