A100574 If n = product{p|n, p=prime} p^b(p,n), where each b(p,n) is a positive integer and the product is over distinct prime divisors of n, a(n) = difference between the maximum p^b(p,n) and minimum p^b(p,n).

0, 0, 0, 0, 0, 1, 0, 0, 0, 3, 0, 1, 0, 5, 2, 0, 0, 7, 0, 1, 4, 9, 0, 5, 0, 11, 0, 3, 0, 3, 0, 0, 8, 15, 2, 5, 0, 17, 10, 3, 0, 5, 0, 7, 4, 21, 0, 13, 0, 23, 14, 9, 0, 25, 6, 1, 16, 27, 0, 2, 0, 29, 2, 0, 8, 9, 0, 13, 20, 5, 0, 1, 0, 35, 22, 15, 4, 11, 0, 11, 0, 39, 0, 4, 12, 41, 26, 3, 0, 7, 6, 19, 28

Offset

1,10

Comments

a(n)=0 iff n a prime or a power of a prime. - Robert G. Wilson v, Jan 10 2005

Links

Antti Karttunen, Table of n, a(n) for n = 1..65537

Formula

a(n) = A034699(n) - A034684(n). - Antti Karttunen, Aug 06 2018

Example

For 24 = 2^3 *3, 2^3 and 3 are separated by 5, so a(30) = 5.

Mathematica

pf[n_] := Block[{pb = Flatten[ Table[ #[[1]]^#[[2]], {1}] & /@ FactorInteger[n]]}, Max[pb] - Min[pb]]; Table[ pf[n], {n, 2, 100}] (* Robert G. Wilson v, Jan 10 2005 *)

Prog

(PARI) A100574(n) = if(1==n, 0, my(f=factor(n), v = vector(#f[, 1], i, f[i, 1]^f[i, 2])); vecmax(v)-vecmin(v)); \\ Antti Karttunen, Aug 06 2018

Crossrefs

Cf. A034684, A034699.

Sequence in context: A049087 A178921 A046665 * A342122 A056100 A141665

Adjacent sequences: A100571 A100572 A100573 * A100575 A100576 A100577

Keyword

nonn

Author

Leroy Quet, Jan 02 2005

Extensions

More terms from Robert G. Wilson v, Jan 10 2005

Status

approved