The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A261192 a(0) = 2; for n>0, a(n) = smallest prime p such that p > a(n-1) and p is congruent to n modulo prime(n). 1
2, 3, 5, 13, 53, 71, 97, 109, 179, 193, 271, 383, 419, 587, 659, 673, 811, 1433, 1543, 1627, 2221, 2357, 4051, 4339, 4919, 5651, 5783, 6619, 6983, 7877, 8053, 11969, 12739, 12911, 14629, 15233, 15287, 15737, 18131, 18743, 20627, 21163, 21943, 22963, 23011, 23291, 25717, 26633, 27031, 27743 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
a(n) == A186102(n) == A260416(n) (mod n).
a(10314) = 10000363333.
LINKS
Ivan N. Ianakiev and Robert G. Wilson v, Table of n, a(n) for n = 0..100000
EXAMPLE
a(4) = 53 because prime(4) = 7, 53 == 4 (mod 7) and 53 is the smallest such prime greater than a(3) = 13.
MATHEMATICA
f[n_] := f[n] = Block[{k = Prime@ n, q = Prime@ n}, While[k + n <= f[n - 1] || ! PrimeQ[k + n], k += q]; k + n]; f[0] = 2; Array[f, 50, 0]
CROSSREFS
Sequence in context: A110364 A111288 A064526 * A103594 A042695 A288943
KEYWORD
nonn
AUTHOR
STATUS
approved

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 June 17 18:36 EDT 2024. Contains 373463 sequences. (Running on oeis4.)