reviewed

approved

proposed

reviewed

editing

proposed

3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 19, 21, 23, 26, 29, 32, 36, 40, 44, 48, 52, 41, 46, 51, 56, 60, 64, 68, 72, 61, 66, 71, 76, 80, 84, 88, 92, 81, 86, 91, 96, 100, 104, 108, 112, 101, 106, 111, 116, 120, 124, 128, 132, 121, 126, 131, 137, 142, 147, 152, 157, 162, 167, 144, 151, 158, 165, 172, 177, 182, 187, 192, 197, 202, 207, 212, 179, 186, 193, 201, 209, 217, 222, 227225, 233, 243, 254, 265, 276, 287, 298, 309, 321, 334

A130231 := proc(n)

option remember;

if n = 1 then

3;

else

a := procname(n-1) ;

for j from 1 to n-1 do

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

if d = 3 then

a := a+1 ;

end if;

end do:

end do:

a ;

end if;

end proc:

seq(A130231(n), n=1..80) ; # R. J. Mathar, Aug 06 2016

Corrected by R. J. Mathar, Aug 06 2016

approved

editing

_Eric Angelini (eric.angelini(AT)kntv.be), _, Aug 05 2007

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

3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 17, 19, 21, 23, 26, 29, 32, 36, 40, 44, 48, 52, 56, 60, 64, 68, 72, 76, 80, 84, 88, 92, 96, 100, 104, 108, 112, 116, 120, 124, 128, 132, 137, 142, 147, 152, 157, 162, 167, 172, 177, 182, 187, 192, 197, 202, 207, 212, 217, 222, 227

1,1

base,easy,nonn

Eric Angelini (eric.angelini(AT)kntv.be), Aug 05 2007

approved