login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A124330 a(n)= ((d(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 and d(n) is the number of positive divisors of n. 2
1, 1, 1, 3, 3, 1, 3, 1, 5, 1, 3, 7, 3, 11, 8, 11, 3, 1, 3, 17, 8, 9, 3, 1, 4, 9, 7, 15, 3, 1, 3, 13, 7, 9, 6, 29, 3, 9, 7, 21, 3, 29, 3, 15, 13, 9, 3, 31, 4, 17, 7, 15, 3, 25, 6, 19, 7, 9, 3, 47, 3, 9, 11, 15, 6, 29, 3, 13, 7, 27, 3, 37, 3, 9, 13, 13, 5, 29, 3, 27, 8, 9, 3, 43, 6, 9, 7, 19, 3, 47, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Table of n, a(n) for n=1..91.

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

CROSSREFS

Cf. A000005, A000010, A124218, A124331.

Sequence in context: A323626 A133695 A138114 * A055177 A030778 A324078

Adjacent sequences:  A124327 A124328 A124329 * A124331 A124332 A124333

KEYWORD

nonn

AUTHOR

Leroy Quet and Ray Chandler, Oct 26 2006

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 27 16:30 EST 2022. Contains 350608 sequences. (Running on oeis4.)