The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A203461 Let a(n) and the ratio r(n) = greatest prime divisor of a(n) / sum of the distinct prime divisors of a(n). The sequence a(n) is defined by the recurrence a(1) = 2, a(n+1) such that r(n+1) < r(n). 0
 2, 6, 30, 105, 210, 2002, 2310, 3003, 5005, 10010, 15015, 30030, 46189, 92378, 138567, 230945, 323323, 646646, 969969, 1616615, 3233230, 4849845, 9699690, 37182145, 74364290, 111546435, 223092870, 3234846615, 6469693230 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS See the same problem with the sequence A002182 where the ratio r(n) = a(n) / sigma(a(n)). LINKS Table of n, a(n) for n=1..29. EXAMPLE a(3) = 30 because the ratio r(3) = 5 /(2+3+5) = 0.5 is smaller than r(2) = 3/(2 + 3) = 0.6 MAPLE with(numtheory):r0:=10^10:for x from 2 to 10^7 do: y:=factorset(x):n1:=nops(y):s:=sum(y[i], i=1..n1):r:= evalf(y[n1]/s):if r < r0 then r0:=r: print(x):else fi:od: CROSSREFS Cf. A008472, A002182. Sequence in context: A051844 A335396 A034501 * A071758 A071760 A304579 Adjacent sequences: A203458 A203459 A203460 * A203462 A203463 A203464 KEYWORD nonn AUTHOR Michel Lagneau, Jan 02 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 5 19:03 EST 2023. Contains 367593 sequences. (Running on oeis4.)