|
Search: id:A032742
|
|
|
| A032742 |
|
a(1) = 1; for n > 1, a(n) = largest proper divisor of n. |
|
+0
37
|
|
| 1, 1, 1, 2, 1, 3, 1, 4, 3, 5, 1, 6, 1, 7, 5, 8, 1, 9, 1, 10, 7, 11, 1, 12, 5, 13, 9, 14, 1, 15, 1, 16, 11, 17, 7, 18, 1, 19, 13, 20, 1, 21, 1, 22, 15, 23, 1, 24, 7, 25, 17, 26, 1, 27, 11, 28, 19, 29, 1, 30, 1, 31, 21, 32, 13, 33, 1, 34, 23, 35, 1, 36, 1, 37, 25, 38, 11, 39, 1, 40
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
Seems equal to a(n)=Max{GCD[n,j]; j=n+1,..,2n-1} - Labos E. (labos(AT)ana.sote.hu), May 22 2002
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..1000
Eric Weisstein's World of Mathematics, See also
|
|
FORMULA
|
A054576(n) = a(a(n)); A117358(n) = a(a(a(n))) = a(A054576(n)); a(A008578(n))=1, a(A002808(n))>1. - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Mar 10 2006
a(n) = A130064(n)/A006530(n). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 05 2007
a(m)*a(n) < a(m*n) for m and n > 1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 11 2008
|
|
CROSSREFS
|
Cf. A032741. Equals n/A020639(n).
Cf. A052126.
Cf. A068319.
Cf. A063928.
Sequence in context: A020952 A079554 A079880 this_sequence A060654 A116512 A075388
Adjacent sequences: A032739 A032740 A032741 this_sequence A032743 A032744 A032745
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
Patrick De Geest (pdg(AT)worldofnumbers.com), May 15, 1998.
|
|
|
Search completed in 0.002 seconds
|
