|
Search: id:A124218
|
|
|
| A124218 |
|
a(n)= m-th positive integer which is coprime to n, where phi(n) is number of positive integers which are <= n and are coprime to n, d(n) is the number of positive divisors of n and m = phi(n) if phi(n)|d(n), else m = d(n) mod phi(n). |
|
+0
3
|
|
| 1, 1, 2, 1, 2, 5, 2, 7, 4, 9, 2, 5, 2, 9, 7, 9, 2, 17, 2, 13, 5, 7, 2, 23, 3, 7, 5, 13, 2, 29, 2, 11, 5, 7, 4, 25, 2, 7, 5, 19, 2, 25, 2, 13, 11, 7, 2, 29, 3, 13, 5, 11, 2, 23, 4, 17, 5, 7, 2, 43, 2, 7, 10, 13, 4, 25, 2, 11, 5, 23, 2, 35, 2, 7, 11, 11, 4, 25, 2, 23, 7, 7, 2, 41, 4, 7, 5, 17, 2, 43, 4
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
MATHEMATICA
|
f[n_] := Block[{k = 0, m = Mod[Length[Divisors[n]], EulerPhi[n], 1]}, While[m > 0, k++; While[GCD[n, k] > 1, k++ ]; m--; ]; k]; Table[f[n], {n, 100}] (*Chandler*)
|
|
CROSSREFS
|
Cf. A000005, A000010, A124219, A124330.
Sequence in context: A109631 A095149 A064192 this_sequence A025165 A106480 A099602
Adjacent sequences: A124215 A124216 A124217 this_sequence A124219 A124220 A124221
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet Oct 19 2006
|
|
EXTENSIONS
|
Edited and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 26 2006
|
|
|
Search completed in 0.002 seconds
|
