|
| |
|
|
A051119
|
|
n/p^k, where p = largest prime dividing n and p^k = highest power of p dividing n.
|
|
2
| |
|
|
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; internal format)
|
|
|
|
OFFSET
| 1,6
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=1..10000
|
|
|
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] (* From Harvey P. Dale, Oct 14 2011 *)
|
|
|
CROSSREFS
| Equals n/A053585(n).
Sequence in context: A167204 A104306 A074389 * A159269 A186728 A009191
Adjacent sequences: A051116 A051117 A051118 * A051120 A051121 A051122
|
|
|
KEYWORD
| nonn,easy,nice
|
|
|
AUTHOR
| Leroy Quet
|
|
|
EXTENSIONS
| More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jan 21 2000
|
| |
|
|
