The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A138792 Least prime, p, such that p == n (Mod sum of the digits of p). 3
 2, 11, 67, 23, 89, 53, 83, 29, 173, 19, 197, 193, 337, 167, 269, 79, 757, 397, 379, 479, 3677, 769, 997, 6967, 1699, 3889, 9857, 7867, 6959, 9949, 16987, 9887, 49697, 47599, 18899, 67979, 73999, 56999, 197699, 49999, 159899, 189989, 98899, 98999, 988877 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS First occurrence of k in A136251. LINKS Robert G. Wilson v, Table of n, a(n) for n = 0..85. EXAMPLE a(2) = 67 = 13*5+2 <--> 2 == 67 (mod 13). MATHEMATICA f[n_] := Block[{p = Prime@ n}, Mod[p, Plus @@ IntegerDigits@ p]]; t = Table[0, {1000}]; Do[ a = f@n; If[a < 1000 && t[[a + 1]] == 0, t[[a + 1]] = Prime@ n; Print[{a, Prime@n}]], {n, 503200000}] lp[n_]:=Module[{p=2}, While[Mod[p, Total[IntegerDigits[p]]]!=n, p= NextPrime[ p]]; p]; Array[lp, 50, 0] (* Harvey P. Dale, Jan 15 2019 *) CROSSREFS Cf. A136251, A138791. Sequence in context: A185627 A216585 A245277 * A058056 A266579 A063768 Adjacent sequences:  A138789 A138790 A138791 * A138793 A138794 A138795 KEYWORD base,nonn AUTHOR Robert G. Wilson v, Mar 28 2008 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.

Last modified June 26 13:24 EDT 2022. Contains 354883 sequences. (Running on oeis4.)