The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A100385 a(n) = the least number x such that for m=x to x+n-1, A006530(m) decreases. 4
 2, 3, 13, 13, 491, 1851, 12721, 12721, 109453, 586951, 120797465, 624141002, 4044619541, 267793490438, 315400191511, 1285600699441 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS A006530(m) is the largest prime factor of m. a(15) > 3*10^11. - Donovan Johnson, Oct 24 2009 a(17) > 7*10^12. - Giovanni Resta, May 04 2017 LINKS EXAMPLE a(5)=491 because the largest prime factors of 491,492,493,494,495 are 491,41,29,19,11. MATHEMATICA Function[s, Prepend[Reverse@ FoldList[If[#2 > #1, #1, #2] &, Reverse@ #], 2] &@ Map[Function[k, First@ SelectFirst[s, And[Sign@ First@ # == 1, Length@ # == k] &]], Range[Max@ Map[Length, s]]]]@ SplitBy[Flatten[ Partition[Array[{#, FactorInteger[#][[-1, 1]]} &, 10^6], 2, 1] /. {{n_, a_}, {_, b_}} /; n > 0 :> -n Sign[Differences@ {a, b}]], Sign] (* Michael De Vlieger, May 04 2017, Version 10.2 *) CROSSREFS Cf. A006530, A070087, A071870, A100384, A100386. Sequence in context: A117684 A056445 A171483 * A250184 A128460 A273617 Adjacent sequences:  A100382 A100383 A100384 * A100386 A100387 A100388 KEYWORD nonn,more AUTHOR Labos Elemer, Dec 09 2004 EXTENSIONS Edited by Don Reble, Jun 13 2007 a(14) from Donovan Johnson, Oct 24 2009 a(15)-a(16) from Giovanni Resta, May 04 2017 STATUS approved

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

Last modified June 12 06:52 EDT 2021. Contains 344943 sequences. (Running on oeis4.)