This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A122425 List the divisors of n; a(n) gives the lexicographically greatest divisor of n. 4
 1, 2, 3, 4, 5, 6, 7, 8, 9, 5, 11, 6, 13, 7, 5, 8, 17, 9, 19, 5, 7, 22, 23, 8, 5, 26, 9, 7, 29, 6, 31, 8, 33, 34, 7, 9, 37, 38, 39, 8, 41, 7, 43, 44, 9, 46, 47, 8, 7, 50, 51, 52, 53, 9, 55, 8, 57, 58, 59, 60, 61, 62, 9, 8, 65, 66, 67, 68, 69, 70, 71, 9, 73, 74, 75, 76, 77, 78, 79, 80, 9, 82, 83 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(p)=p for primes p; a(A122427(n))=A122427(n), a(A122426(n)) < A122426(n); a(A122428(n)) = A006530(A122428(n)). LINKS _Reinhard Zumkeller_, Table of n, a(n) for n = 1..10000 EXAMPLE Divisors(24) = [1,2,3,4,6,8,12,24] --> [1,12,2,24,3,4,6,8], therefore a(24) = 8; Divisors(42) = [1,2,3,6,7,14,21,42] --> [1,14,2,21,3,42,6,7], therefore a(42) = 7. PROG (Haskell) import Data.Ord (comparing) import Data.List (sortBy) a122425 n = last \$ sortBy (comparing show) [d | d <- [1..n], mod n d == 0] -- Reinhard Zumkeller, Sep 15 2011 CROSSREFS Sequence in context: A061500 A051796 A093030 * A074044 A079827 A216196 Adjacent sequences:  A122422 A122423 A122424 * A122426 A122427 A122428 KEYWORD nonn,base AUTHOR Reinhard Zumkeller, Sep 04 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 .