login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130231 a(1) = 3; a(n) = a(n-1) + (number of times the digit 3 has appeared in the sequence so far). 1

%I #6 Aug 06 2016 23:10:36

%S 3,4,5,6,7,8,9,10,11,12,13,15,17,19,21,23,26,29,32,36,41,46,51,56,61,

%T 66,71,76,81,86,91,96,101,106,111,116,121,126,131,137,144,151,158,165,

%U 172,179,186,193,201,209,217,225,233,243,254,265,276,287,298,309,321,334

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

%p A130231 := proc(n)

%p option remember;

%p if n = 1 then

%p 3;

%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 = 3 then

%p a := a+1 ;

%p end if;

%p end do:

%p end do:

%p a ;

%p end if;

%p end proc:

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

%K base,easy,nonn

%O 1,1

%A _Eric Angelini_, Aug 05 2007

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 05:56 EDT 2024. Contains 371964 sequences. (Running on oeis4.)