|
Search: id:A136251
|
|
|
| A136251 |
|
a(n) = n-th prime reduced modulo the sum of its digits. |
|
+0
2
|
|
| 0, 0, 0, 0, 1, 1, 1, 9, 3, 7, 3, 7, 1, 1, 3, 5, 3, 5, 2, 7, 3, 15, 6, 4, 1, 1, 3, 3, 9, 3, 7, 1, 5, 9, 9, 4, 1, 3, 13, 8, 9, 1, 4, 11, 10, 9, 3, 6, 7, 8, 1, 1, 3, 3, 5, 10, 14, 1, 5, 6, 10, 13, 7, 1, 5, 9, 2, 12, 11, 13, 1, 2, 15, 9, 18, 5, 9, 17, 1, 6, 13, 1, 7, 3, 7, 3, 7, 9, 10, 8, 8, 19, 12, 1, 15, 7, 5
(list; graph; listen)
|
|
|
OFFSET
|
1,8
|
|
|
COMMENT
|
First occurrence of k: A138792. - Robert G. Wilson v, (rgwv(AT)rgwv.com), Mar 27 2008
|
|
EXAMPLE
|
2 = 2*1 + 0
3 = 3*1 + 0
5 = 5*1 + 0
7 = 7*1 + 0
11 = 2*5 + 1 (the sum of the digits of 11 is equal to 2)
13 = 4*3 + 1
17 = 8*2 + 1
19 = 10*1 + 9
|
|
MATHEMATICA
|
f[n_] := Block[{p = Prime@n}, Mod[p, Plus @@ IntegerDigits@p]]; Array[f, 97] - Robert G. Wilson v, (rgwv(AT)rgwv.com), Mar 27 2008
|
|
CROSSREFS
|
Cf. A000040, A138791, A138792.
Adjacent sequences: A136248 A136249 A136250 this_sequence A136252 A136253 A136254
Sequence in context: A011390 A011229 A068353 this_sequence A073002 A011282 A021520
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
Odimar Fabeny (aifab(AT)yahoo.com.br), Mar 17 2008
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v, (rgwv(AT)rgwv.com), Mar 27 2008
|
|
|
Search completed in 0.002 seconds
|
