A130232 - OEIS

%I #14 Feb 08 2025 16:04:59

%S 0,1,2,3,4,5,6,7,8,9,10,12,14,16,18,20,23,26,29,32,35,38,41,44,47,50,

%T 54,58,62,66,70,75,80,86,92,98,104,111,118,125,132,139,146,153,160,

%U 168,176,184,192,200,210,221,232,243,254,265,276,287,298,309,321,333,345,357,369

%N a(1) = 0; a(n) = a(n-1) + (number of times the digit 0 has appeared in the sequence so far).

%p A130232 := proc(n)

%p     option remember;

%p     if n = 1 then

%p         0;

%p     else

%p         a := procname(n-1) ;

%p         for j from 1 to n-1 do

%p             for d in convert(procname(j),base,10) do

%p                 if d = 0 then

%p                     a := a+1 ;

%p                 end if;

%p             end do:

%p         end do:

%p         a+1 ;

%p     end if;

%p end proc:

%p seq(A130232(n),n=1..80) ; # _R. J. Mathar_, Aug 06 2016

%t ss=s={0};Do[a=ss[[-1]]+Count[s,0];s=Join[s,IntegerDigits[a]];AppendTo[ss,a],{n,64}];ss (* _James C. McMahon_, Feb 08 2025 *)

%o (Python)

%o A130232_list, c = [0], 1

%o for _ in range(100):

%o     A130232_list.append(A130232_list[-1]+c)

%o     c += str(A130232_list[-1]).count('0') # _Chai Wah Wu_, Jun 06 2021

%K base,easy,nonn,changed

%O 1,3

%A _Eric Angelini_, Aug 05 2007

%E Corrected by _R. J. Mathar_, Aug 06 2016