id:A124333 - OEIS Search Results

Search: id:A124333

Displaying 1-1 of 1 results found.

page 1

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.

+0
3

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 (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[n, EulerPhi[n]] + 1}, While[m > 0, k++; While[GCD[n, k] > 1, k++ ]; m--; ]; k]; Table[f[n], {n, 100}] (Chandler)`
	CROSSREFS	`Cf. A000010, A122383, A124332.` `Sequence in context: A100376 A020738 A063279 this_sequence A144757 A002107 A133099` `Adjacent sequences: A124330 A124331 A124332 this_sequence A124334 A124335 A124336`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet and Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 26 2006`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research