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

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A023152 Numbers n such that prime(n) == 10 (mod n). 18
1, 7, 19, 21, 2703, 15929, 4124583, 27067051, 179992913, 179993011, 179993159, 1208198559, 1208198859, 55762149031 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

MATHEMATICA

NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == 10, Print[n]], {n, 1, 10^9}] (from Robert G. Wilson v Feb 18 2004)

PROG

(Sage)

def A023152(max) :

....terms = []

....p = 2

....for n in xrange(1, max+1) :

........if (p - 10) % n == 0 : terms.append(n)

........p = next_prime(p)

....return terms

end # Eric M. Schmidt, Feb 05 2013

CROSSREFS

Cf. A092052, A023143, A023144, A023145, A023146, A023147, A023148, A023149, A023150, A023151.

Sequence in context: A109637 A039513 A125265 * A123532 A113972 A082422

Adjacent sequences:  A023149 A023150 A023151 * A023153 A023154 A023155

KEYWORD

nonn

AUTHOR

David W. Wilson

EXTENSIONS

Extended by Robert G. Wilson v, Feb 18 2004

a(9)-a(14) from Robert G. Wilson v, Feb 22 2006

First two terms added by Eric M. Schmidt, Feb 05 2013

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified April 20 13:42 EDT 2014. Contains 240806 sequences.