cp's OEIS Frontend

A214913 a(n+1) = a(n) + max(1, count0s), where count0s is number of 0's in binary representation of a(n).

%I A214913 #18 Jun 06 2025 00:29:03
%S A214913 0,1,2,3,4,6,7,8,11,12,14,15,16,20,23,24,27,28,30,31,32,37,40,44,47,
%T A214913 48,52,55,56,59,60,62,63,64,70,74,78,81,85,88,92,95,96,101,104,108,
%U A214913 111,112,116,119,120,123,124,126,127,128,135,139,143,146,151,154,158
%N A214913 a(n+1) = a(n) + max(1, count0s), where count0s is number of 0's in binary representation of a(n).
%H A214913 Harvey P. Dale, <a href="/A214913/b214913.txt">Table of n, a(n) for n = 1..1000</a>
%F A214913 a(0) = 0, a(n+1) = a(n) + max(1, A023416(a(n))). - _David Radcliffe_, Jun 05 2025
%t A214913 NestList[#+Max[1,DigitCount[#,2,0]]&,0,70] (* _Harvey P. Dale_, Apr 21 2016 *)
%o A214913 (Python)
%o A214913 a = 0
%o A214913 for n in range(100):
%o A214913     print(a, end=', ')
%o A214913     ta = a
%o A214913     c0 = (a==0)
%o A214913     while ta>0:
%o A214913         c0 += 1-(ta&1)
%o A214913         ta >>= 1
%o A214913     a += max(c0,1)
%Y A214913 Cf. A010062, A023416.
%K A214913 nonn,base
%O A214913 1,3
%A A214913 _Alex Ratushnyak_, Aug 03 2012