|
| |
|
|
A034699
|
|
Largest prime power factor of n.
|
|
31
| |
|
|
1, 2, 3, 4, 5, 3, 7, 8, 9, 5, 11, 4, 13, 7, 5, 16, 17, 9, 19, 5, 7, 11, 23, 8, 25, 13, 27, 7, 29, 5, 31, 32, 11, 17, 7, 9, 37, 19, 13, 8, 41, 7, 43, 11, 9, 23, 47, 16, 49, 25, 17, 13, 53, 27, 11, 8, 19, 29, 59, 5, 61, 31, 9, 64, 13, 11, 67, 17, 23, 7, 71, 9, 73, 37, 25, 19, 11, 13, 79
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| n divides lcm(1, 2, ..., a(n)).
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=1..1000
|
|
|
FORMULA
| If n = p_1^e_1 *...* p_k^e_k, p_1<...<p_k primes, then a(n) = max { p_i^e_i }.
|
|
|
MATHEMATICA
| f[n_] := If[n == 1, 1, Max[ #[[1]]^#[[2]] & /@ FactorInteger@n]]; Array[f, 79] (* Robert G. Wilson v Sep 02 2006 *)
|
|
|
PROG
| (Haskell)
a034699 n = head [x | x <- reverse $ a027750_row n, a010055 x == 1]
-- Reinhard Zumkeller, Feb 14 2012
|
|
|
CROSSREFS
| Cf. A020639, A006530, A034684, A028233, A034699, A053585.
See also A051283, A052128.
Cf. A038610.
Cf. A027750, A010055.
Sequence in context: A067620 A053585 A098988 * A111615 A053627 A125746
Adjacent sequences: A034696 A034697 A034698 * A034700 A034701 A034702
|
|
|
KEYWORD
| nonn,easy,nice,changed
|
|
|
AUTHOR
| David W. Wilson (davidwwilson(AT)comcast.net)
|
| |
|
|
