|
Search: id:A100574
|
|
|
| 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
1
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
1,10
|
|
|
COMMENT
|
a(n)=0 iff n a prime or a power of a prime. - Robert G. Wilson v Jan 10 2005. - Robert G. Wilson v (rgwv(AT)rgwv.com), Jan 10 2005
|
|
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}] (from Robert G. Wilson v Jan 10 2005)
|
|
CROSSREFS
|
Sequence in context: A100573 A049087 A046665 this_sequence A056100 A136689 A073278
Adjacent sequences: A100571 A100572 A100573 this_sequence A100575 A100576 A100577
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Jan 02 2005
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Jan 10 2005
|
|
|
Search completed in 0.002 seconds
|
