|
|
A051119
|
|
n/p^k, where p = largest prime dividing n and p^k = highest power of p dividing n.
|
|
20
|
|
|
1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 4, 1, 2, 3, 1, 1, 2, 1, 4, 3, 2, 1, 8, 1, 2, 1, 4, 1, 6, 1, 1, 3, 2, 5, 4, 1, 2, 3, 8, 1, 6, 1, 4, 9, 2, 1, 16, 1, 2, 3, 4, 1, 2, 5, 8, 3, 2, 1, 12, 1, 2, 9, 1, 5, 6, 1, 4, 3, 10, 1, 8, 1, 2, 3, 4, 7, 6, 1, 16, 1, 2, 1, 12, 5, 2, 3, 8, 1, 18, 7, 4, 3, 2, 5, 32, 1, 2, 9, 4, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(36) = 4 because 36/3^2 = 4, 3^2 is highest power dividing 36 of largest prime dividing 36.
a(50) = 50 / 5^2 = 2.
|
|
MATHEMATICA
|
f[n_]:=Module[{c=Last[FactorInteger[n]]}, n/First[c]^Last[c]]; Array[ f, 110] (* Harvey P. Dale, Oct 14 2011 *)
|
|
PROG
|
(Python)
from sympy import factorint, primefactors
def a053585(n):
if n==1: return 1
p = primefactors(n)[-1]
return p**factorint(n)[p]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|