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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A087523 a(0) = 2, a(n) = smallest prime == n mod a(n-1), a(n)>a(n-1). 1
2, 3, 5, 13, 17, 73, 79, 797, 2399, 38393, 345547, 2073293, 39392579, 472710961, 4254398663, 93596770601, 2152725723839, 8610902895373, 8610902895391, 86109028953929, 602763202677523, 12055264053550481, 204939488910358199 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Harvey P. Dale, Table of n, a(n) for n = 0..100

EXAMPLE

a(3) = 13 == 3 (mod 5), a(4) = 17 == 4 (mod 13), 73 == 5 (mod 17).

MATHEMATICA

nw[{n_, a_}]:=NestWhile[#+a&, a+n+1, !PrimeQ[#]&]; nxt[{n_, a_}]:={n+1, nw[{n, a}]}; Transpose[NestList[nxt, {0, 2}, 25]][[2]] (* Harvey P. Dale, Jun 10 2016 *)

CROSSREFS

Sequence in context: A163268 A235624 A108562 * A073919 A162573 A087356

Adjacent sequences:  A087520 A087521 A087522 * A087524 A087525 A087526

KEYWORD

nonn

AUTHOR

Amarnath Murthy, Sep 11 2003

EXTENSIONS

More terms from Ray Chandler, Sep 14 2003

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 April 24 00:02 EDT 2019. Contains 322404 sequences. (Running on oeis4.)