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

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!)
 A092052 Numbers n such that prime(n) == -10 (mod n). 10
 1, 3, 437, 2639, 4124589, 27067013, 27067101, 27067139, 27067271, 382465573551, 18262325820327, 18262325820329, 18262325820333, 885992692751831, 6201265271239783, 6201265271239997, 6201265271240071, 6201265271240403, 306268030480171331 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS MATHEMATICA NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == n - 10, Print[n]], {n, 1, 10^9}] CROSSREFS Cf. A023152, A045924, A092044, A092045, A092046, A092047, A092048, A092049, A092050, A092051. Sequence in context: A269553 A086207 A326373 * A139999 A140870 A157601 Adjacent sequences:  A092049 A092050 A092051 * A092053 A092054 A092055 KEYWORD nonn,more AUTHOR Robert G. Wilson v, Feb 18 2004 EXTENSIONS Corrected by Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Feb 20 2004 a(10)-a(19) from Giovanni Resta, Feb 23 2020 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 December 3 13:43 EST 2021. Contains 349463 sequences. (Running on oeis4.)