This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A122377 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). 2
 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; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS 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, Jul 11 2009] Sequence in context: A080388 A104308 A175456 * A169758 A175933 A175940 Adjacent sequences:  A122374 A122375 A122376 * A122378 A122379 A122380 KEYWORD nonn AUTHOR Leroy Quet, Oct 19 2006 EXTENSIONS Edited and extended by 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 | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .