Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100383
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A100383 Numbers n such that Lpf[n]<Lpf[n+1]<...<Lpf[n+9], where Lpf[x]=A00530[x], the largest prime factor of x. Numbers initiating an uphill-Lpf-run of length 10. +0
1
721970, 1091150, 6449639, 6449640, 10780550, 12161824, 15571630, 17332430, 23189750, 24901256, 28262037, 30275508, 30814114, 32184457, 32608598, 35323087, 35725704, 38265227, 38896955, 69845438, 71040720, 74345936 (list; graph; listen)
OFFSET

1,1

COMMENT

Analogous chains of length 3 [See A071869] are infinite as shown by Erdos and Pomerance (1978). What is true for longer successions of length=4,5,...?

REFERENCES

Erdos P. and Pomerance C., "On the largest prime factors of n and n+1", Aequationes Math. vol. 17, 1978, pp. 311-321.

EXAMPLE

n=85293163: the corresponding uphill-run of Lpf-s is [739,5197,6311,7457,8537,1776941,6561013,8529317,9477019,21323293]

CROSSREFS

Cf. A006530, A071869, A070089, A100376, A100384.

Sequence in context: A015346 A153580 A153581 this_sequence A156867 A156868 A107447

Adjacent sequences: A100380 A100381 A100382 this_sequence A100384 A100385 A100386

KEYWORD

nonn

AUTHOR

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

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 24 14:25 EST 2009. Contains 167438 sequences.


AT&T Labs Research