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!)
A130224 a(1) = 1; a(n) = a(n-1) + (number of times the digit 1 has appeared in the sequence so far). 2

%I #4 Aug 06 2016 16:34:33

%S 1,2,3,4,5,6,7,8,9,10,12,15,19,24,29,34,39,44,49,54,59,64,69,74,79,84,

%T 89,94,99,104,110,118,128,139,151,165,180,196,213,231,250,269,288,307,

%U 326,345,364,383,402,421,441,462

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

%p A130224 := proc(n)

%p option remember;

%p if n = 1 then

%p 1;

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

%p a := a+1 ;

%p end if;

%p end do:

%p end do:

%p a ;

%p end if;

%p end proc:

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

%K base,easy,nonn

%O 1,2

%A _Eric Angelini_, Aug 05 2007

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 11:39 EDT 2024. Contains 371969 sequences. (Running on oeis4.)