login
This site is supported by donations to The OEIS Foundation.
Logo

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. 3
2, 3, 13, 13, 491, 1851, 12721, 12721, 109453, 586951, 120797465, 624141002, 4044619541, 267793490438 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

A006530(m) is the largest prime factor of m.

a(15) > 3*10^11. [From Donovan Johnson (donovan.johnson(AT)yahoo.com), Oct 24 2009]

EXAMPLE

a(5)=491 because the largest prime factors of 491,492,493,494,495 are 491,41,29,19,11.

CROSSREFS

Cf. A006530, A070087, A071870, A100384, A100386.

Sequence in context: A117684 A056445 A171483 * A128460 A101541 A059670

Adjacent sequences:  A100382 A100383 A100384 * A100386 A100387 A100388

KEYWORD

nonn,more

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Dec 09 2004

EXTENSIONS

Edited by Don Reble (djr(AT)nk.ca), Jun 13 2007

a(14) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Oct 24 2009

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 .

Last modified February 16 19:20 EST 2012. Contains 205945 sequences.