login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A194955 Slowest increasing sequence of primes such that a(1)=2, a(n)-a(n-1) is a multiple of A000120(a(n-1)). 2
2, 3, 5, 7, 13, 19, 31, 41, 47, 67, 73, 79, 89, 97, 103, 113, 137, 149, 157, 167, 197, 229, 239, 281, 293, 313, 353, 373, 379, 421, 431, 487, 557, 577, 601, 631, 659, 709, 719, 733, 761, 859, 887, 911, 953, 967, 1009, 1051, 1061, 1069 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

MAPLE

A000120 := proc(n)

        wt(n) ;

end proc:

A194955 := proc(n)

        option remember;

        local p;

        if n = 1 then

                2;

        else

                p := nextprime(procname(n-1)) ;

                while (p-procname(n-1)) mod A000120(procname(n-1)) <> 0 do

                        p := nextprime(p);

                end do;

                p ;

        end if;

end proc:

seq(A194955(n), n=1..80) ; # R. J. Mathar, Sep 20 2011

CROSSREFS

Cf. A000120, A194954.

Sequence in context: A175762 A088091 A332088 * A217884 A101045 A114847

Adjacent sequences:  A194952 A194953 A194954 * A194956 A194957 A194958

KEYWORD

nonn

AUTHOR

Vladimir Shevelev, Sep 06 2011

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 December 5 18:32 EST 2021. Contains 349557 sequences. (Running on oeis4.)