|
Search: id:A122383
|
|
|
| A122383 |
|
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 and m = phi(n) if phi(n)|n, else m = n mod phi(n).. |
|
+0
3
|
|
| 1, 1, 1, 3, 1, 5, 1, 7, 4, 3, 1, 11, 1, 3, 13, 15, 1, 17, 1, 9, 16, 3, 1, 23, 6, 3, 13, 9, 1, 19, 1, 31, 20, 3, 16, 35, 1, 3, 23, 19, 1, 19, 1, 7, 38, 3, 1, 47, 8, 23, 29, 7, 1, 53, 19, 17, 32, 3, 1, 43, 1, 3, 46, 63, 22, 19, 1, 7, 38, 61, 1, 71, 1, 3, 64, 7, 20, 19, 1, 39, 40, 3, 1, 41, 27, 3
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
MATHEMATICA
|
f[n_] := Block[{k = 0, m = Mod[n, EulerPhi[n], 1]}, While[m > 0, k++; While[GCD[n, k] > 1, k++ ]; m--; ]; k]; Table[f[n], {n, 90}] (*Chandler*)
|
|
CROSSREFS
|
Cf. A000010, A122377, A124333.
Sequence in context: A093411 A147088 A118402 this_sequence A136180 A095112 A160596
Adjacent sequences: A122380 A122381 A122382 this_sequence A122384 A122385 A122386
|
|
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
|
