This site is supported by donations to The OEIS Foundation.

 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). 1
 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, 89, 94, 99, 104, 110, 118, 128, 139, 151, 165, 180, 196, 213, 231, 250, 269, 288, 307, 326, 345, 364, 383, 402, 421, 441, 462 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS MAPLE A130224 := proc(n)     option remember;     if n = 1 then         1;     else         a := procname(n-1) ;         for j from 1 to n-1 do             for d in convert(procname(j), base, 10) do                 if d = 1 then                     a := a+1 ;                 end if;             end do:         end do:         a ;     end if; end proc: seq(A130224(n), n=1..52) ; # R. J. Mathar, Aug 06 2016 CROSSREFS Sequence in context: A236686 A246084 A260768 * A017903 A005711 A322856 Adjacent sequences:  A130221 A130222 A130223 * A130225 A130226 A130227 KEYWORD base,easy,nonn AUTHOR Eric Angelini, Aug 05 2007 STATUS approved

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

Last modified April 18 22:08 EDT 2019. Contains 322237 sequences. (Running on oeis4.)