Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100385
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A100385 a(n) = the least number x such that for m=x to x+n-1, A006530(m) decreases. +0
4
2, 3, 13, 13, 491, 1851, 12721, 12721, 109453, 586951, 120797465, 624141002, 4044619541, 267793490438 (list; graph; listen)
OFFSET

1,1

COMMENT

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: A129671 A117684 A056445 this_sequence A128460 A101541 A059670

Adjacent sequences: A100382 A100383 A100384 this_sequence 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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research