id:A122377 - OEIS Search Results

Search: id:A122377

Displaying 1-1 of 1 results found.

page 1

a(n) = m-th positive divisor of n, where d(n) is number of positive divisors of n and m = d(n) if d(n)|n, else m = n mod d(n).

+0
3

1, 2, 1, 1, 1, 2, 1, 8, 9, 2, 1, 12, 1, 2, 5, 1, 1, 18, 1, 2, 1, 2, 1, 24, 1, 2, 9, 7, 1, 10, 1, 2, 1, 2, 7, 36, 1, 2, 13, 40, 1, 2, 1, 2, 5, 2, 1, 16, 1, 2, 17, 13, 1, 18, 11, 56, 1, 2, 1, 60, 1, 2, 7, 1, 1, 2, 1, 2, 1, 14, 1, 72, 1, 2, 5, 19, 1, 26, 1, 80, 1, 2, 1, 84, 1, 2, 29, 88, 1, 9, 13, 2, 1, 2 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	MATHEMATICA	`f[n_] := Block[{d = Divisors[n]}, d[[Mod[n, Length[d], 1]]]]; Table[f[n], {n, 100}] (Chandler)`
	CROSSREFS	`Cf. A000005, A122383, A124332.` `Cf. A033950 (fixed points). [From Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Jul 11 2009]` `Sequence in context: A114717 A080388 A104308 this_sequence A037827 A086074 A089723` `Adjacent sequences: A122374 A122375 A122376 this_sequence A122378 A122379 A122380`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet, Oct 19 2006`
	EXTENSIONS	`Edited and extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 26 2006`

page 1

Search completed in 0.002 seconds

Last modified December 20 16:13 EST 2009. Contains 171081 sequences.

AT&T Labs Research