|
Search: id:A071169
|
|
|
| A071169 |
|
Smallest number x such that Mod[p(x),Phi{x}]=2n-1. |
|
+0
2
|
|
| 3, 5, 7, 15, 22, 17, 19, 48, 23, 41, 82, 39, 29, 47, 77, 94, 53, 91, 112, 69, 81, 61, 59, 101, 189, 142, 103, 85, 107, 109, 203, 354, 148, 95, 1122, 158, 169, 141, 119, 127, 166, 241, 226, 491, 131, 125, 137, 185, 251, 393, 242, 133, 332, 139, 244, 340, 402
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
a(n)=Min{x; A071168[x]=2n-1}
|
|
EXAMPLE
|
n=5, a(5)=22, p(22)=79, Phi[22]=10, Mod[79,10]=9=2n-1=5.
|
|
MATHEMATICA
|
f[x_] := Mod[Prime[x], EulerPhi[x]] t=Table[0, {256}]; Do[s=f[n]; If[s<257&&t[[s]]==0, t[[s]]=n], {n, 1, 100000}]; t
|
|
CROSSREFS
|
Cf. A000040, A000010, A066936, A071168.
Sequence in context: A018617 A018286 A057743 this_sequence A124248 A029514 A061950
Adjacent sequences: A071166 A071167 A071168 this_sequence A071170 A071171 A071172
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), May 15 2002
|
|
|
Search completed in 0.002 seconds
|
