login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130225 a(1) = 2; a(n) = a(n-1) + (number of times the digit 2 has appeared in the sequence so far). 1
2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 16, 18, 20, 23, 27, 32, 38, 44, 50, 56, 62, 69, 76, 83, 90, 97, 104, 111, 118, 125, 133, 141, 149, 157, 165, 173, 181, 189, 197, 205, 214, 224, 236, 249, 263, 278, 294, 311, 328, 346, 364, 382, 401, 420, 440, 460, 480, 500, 520 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..61.

MAPLE

A130225 := proc(n)

    option remember;

    if n = 1 then

        2;

    else

        a := procname(n-1) ;

        for j from 1 to n-1 do

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

                if d = 2 then

                    a := a+1 ;

                end if;

            end do:

        end do:

        a ;

    end if;

end proc:

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

CROSSREFS

Sequence in context: A008730 A033064 A246074 * A096902 A246081 A117325

Adjacent sequences:  A130222 A130223 A130224 * A130226 A130227 A130228

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 15 20:04 EDT 2019. Contains 328037 sequences. (Running on oeis4.)