A124333 a(n) = ((n mod phi(n)) +1)th positive integer which is coprime to n, where phi(n) is number of positive integers which are <= n and are coprime to n.

1, 1, 2, 1, 2, 1, 2, 1, 5, 7, 2, 1, 2, 5, 14, 1, 2, 1, 2, 11, 17, 5, 2, 1, 7, 5, 14, 11, 2, 23, 2, 1, 23, 5, 17, 1, 2, 5, 25, 21, 2, 23, 2, 9, 41, 5, 2, 1, 9, 27, 31, 9, 2, 1, 21, 19, 34, 5, 2, 47, 2, 5, 47, 1, 23, 23, 2, 9, 40, 67, 2, 1, 2, 5, 67, 9, 23, 23, 2, 41, 41, 5, 2, 43, 28, 5, 49, 19, 2

Offset

1,3

Links

Vincenzo Librandi, Table of n, a(n) for n = 1..10000

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, 100}] (* Ray Chandler, Oct 26 2006 *)

Crossrefs

Cf. A000010, A122383, A124332.

Sequence in context: A247051 A247050 A322401 * A144757 A363520 A215136

Adjacent sequences: A124330 A124331 A124332 * A124334 A124335 A124336

Keyword

nonn

Author

Leroy Quet and Ray Chandler, Oct 26 2006

Status

approved