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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A085393 Difference between the largest and the smallest prime factor of greatest proper divisor of n. 2
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 1, 0, 0, 0, 5, 0, 2, 0, 0, 0, 0, 0, 1, 0, 0, 0, 3, 0, 4, 0, 9, 2, 0, 0, 1, 0, 0, 0, 11, 0, 0, 0, 5, 0, 0, 0, 3, 0, 0, 4, 0, 0, 8, 0, 15, 0, 2, 0, 1, 0, 0, 0, 17, 0, 10, 0, 3, 0, 0, 0, 5, 0, 0, 0, 9, 0, 2, 0, 21, 0, 0, 0, 1, 0, 0, 8, 3, 0, 14 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,20

LINKS

Table of n, a(n) for n=1..102.

FORMULA

A085392 - A014673.

MATHEMATICA

PrimeFactors[n_] := Flatten[ Table[ # [[1]], {1}] & /@ FactorInteger[n]]; f[n_] := Block[{gpd = Divisors[n][[ -2]]}, If[gpd == 1, 0, PrimeFactors[gpd][[ -1]] - PrimeFactors[gpd][[1]] ]]; Table[ If[n == 1, 0, f[n]], {n, 1, 102}]

CROSSREFS

Sequence in context: A046775 A221787 A204060 * A128980 A096693 A193139

Adjacent sequences:  A085390 A085391 A085392 * A085394 A085395 A085396

KEYWORD

nonn

AUTHOR

Robert G. Wilson v and Reinhard Zumkeller, Jun 26 2003

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 18 19:06 EST 2017. Contains 294894 sequences.