id:A085393 - OEIS Search Results

Search: id:A085393

Displaying 1-1 of 1 results found.

page 1

Difference between the largest and the smallest prime factor of greatest proper divisor of n.

+0
3

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; listen)

	OFFSET	`1,20`
	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: A097017 A108707 A046775 this_sequence A128980 A096693 A083206` `Adjacent sequences: A085390 A085391 A085392 this_sequence A085394 A085395 A085396`
	KEYWORD	`nonn`
	AUTHOR	`Robert G. Wilson v (rgwv(AT)rgwv.com) and Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Jun 26 2003`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research