|
|
A015052
|
|
a(n) is the smallest positive integer m such that m^5 is divisible by n.
|
|
9
|
|
|
1, 2, 3, 2, 5, 6, 7, 2, 3, 10, 11, 6, 13, 14, 15, 2, 17, 6, 19, 10, 21, 22, 23, 6, 5, 26, 3, 14, 29, 30, 31, 2, 33, 34, 35, 6, 37, 38, 39, 10, 41, 42, 43, 22, 15, 46, 47, 6, 7, 10, 51, 26, 53, 6, 55, 14, 57, 58, 59, 30, 61, 62, 21, 4, 65, 66, 67, 34, 69, 70, 71, 6, 73, 74, 15, 38, 77, 78
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
A multiplicative companion function n/a(n) = 1,1,1,2,1,1,1,4,3,1,1,2,1,1,1,8,1,... can be defined using the 5th instead of the 4th power in A000190, which differs from A000190 and also from A003557. - R. J. Mathar, Jul 14 2012
|
|
LINKS
|
|
|
FORMULA
|
Sum_{k=1..n} a(k) ~ c * n^2, where c = (zeta(9)/2) * Product_{p prime} (1 - 1/p^2 + 1/p^3 - 1/p^4 + 1/p^5 - 1/p^6 + 1/p^7 - 1/p^8) = 0.3523622369... . - Amiram Eldar, Oct 27 2022
|
|
MATHEMATICA
|
f[p_, e_] := p^Ceiling[e/5]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Sep 18 2020 *)
|
|
PROG
|
(PARI) a(n) = my(f=factor(n)); for (i=1, #f~, f[i, 2] = ceil(f[i, 2]/5)); factorback(f); \\ Michel Marcus, Feb 15 2015
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,mult,easy
|
|
AUTHOR
|
R. Muller
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|