|
Search: id:A138792
|
|
|
| A138792 |
|
Least prime, p, such that p == n (Mod sum of the digits of p). |
|
+0
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; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
First occurrence of k in A136251.
|
|
LINKS
|
Robert G. Wilson v, Table of n, a(n) for n = 0..85.
|
|
EXAMPLE
|
A000002(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}]
|
|
CROSSREFS
|
Cf. A136251, A138791.
Adjacent sequences: A138789 A138790 A138791 this_sequence A138793 A138794 A138795
Sequence in context: A074613 A039632 A143816 this_sequence A058056 A063768 A042245
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Mar 28 2008
|
|
|
Search completed in 0.002 seconds
|
