id:A124331 - OEIS Search Results

Search: id:A124331

Displaying 1-1 of 1 results found.

page 1

a(n)= ((phi(n) mod d(n)) +1)th positive divisor of 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.

+0
3

1, 2, 1, 4, 1, 3, 1, 1, 1, 1, 1, 6, 1, 7, 1, 8, 1, 1, 1, 4, 1, 11, 1, 1, 25, 1, 9, 1, 1, 1, 1, 16, 1, 1, 1, 4, 1, 19, 1, 1, 1, 7, 1, 4, 1, 23, 1, 12, 1, 5, 1, 1, 1, 3, 1, 1, 1, 1, 1, 5, 1, 31, 1, 16, 1, 11, 1, 4, 1, 1, 1, 1, 1, 1, 25, 1, 1, 1, 1, 4, 81, 1, 1, 1, 1, 43, 1, 1, 1, 1, 1, 4, 1, 47, 1, 24, 1, 1, 1 (list; graph; listen)

	OFFSET	`1,2`
	MATHEMATICA	`f[n_] := Block[{d = Divisors[n]}, d[[Mod[EulerPhi[n], Length[d]] + 1]]]; Table[f[n], {n, 100}] (Chandler)`
	CROSSREFS	`Cf. A000005, A000010, A124219, A124330.` `Sequence in context: A030652 A077904 A088964 this_sequence A095248 A122458 A127461` `Adjacent sequences: A124328 A124329 A124330 this_sequence A124332 A124333 A124334`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com) and Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 26 2006`

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research