login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A111089
Largest prime factor of 2n.
1
2, 2, 3, 2, 5, 3, 7, 2, 3, 5, 11, 3, 13, 7, 5, 2, 17, 3, 19, 5, 7, 11, 23, 3, 5, 13, 3, 7, 29, 5, 31, 2, 11, 17, 7, 3, 37, 19, 13, 5, 41, 7, 43, 11, 5, 23, 47, 3, 7, 5, 17, 13, 53, 3, 11, 7, 19, 29, 59, 5, 61, 31, 7, 2, 13, 11, 67, 17, 23, 7, 71, 3, 73, 37, 5, 19, 11, 13, 79, 5, 3, 41, 83, 7
OFFSET
1,1
COMMENTS
For composite indices we have a(n*m) = max(a(n), a(m)). - Stefan Steinerberger, Nov 13 2005
Same as A006530 except for initial term. - Franklin T. Adams-Watters, Jul 17 2008
MATHEMATICA
Table[FactorInteger[2n][[ -1, 1]], {n, 100}] (* Ray Chandler, Nov 12 2005 *)
CROSSREFS
Bisection of A006530.
Sequence in context: A162753 A307994 A238480 * A051664 A318884 A280990
KEYWORD
nonn
AUTHOR
Giovanni Teofilatto, Nov 12 2005
EXTENSIONS
Corrected and extended by Ray Chandler and Stefan Steinerberger, Nov 12 2005
STATUS
approved