|
|
A348038
|
|
a(n) = A003968(n) / gcd(n, A003968(n)), where A003968 is multiplicative with a(p^e) = p*(p+1)^(e-1).
|
|
6
|
|
|
1, 1, 1, 3, 1, 1, 1, 9, 4, 1, 1, 3, 1, 1, 1, 27, 1, 4, 1, 3, 1, 1, 1, 9, 6, 1, 16, 3, 1, 1, 1, 81, 1, 1, 1, 2, 1, 1, 1, 9, 1, 1, 1, 3, 4, 1, 1, 27, 8, 6, 1, 3, 1, 16, 1, 9, 1, 1, 1, 3, 1, 1, 4, 243, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 6, 3, 1, 1, 1, 27, 64, 1, 1, 3, 1, 1, 1, 9, 1, 4, 1, 3, 1, 1, 1, 81, 1, 8, 4, 9, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
f[p_, e_] := p*(p + 1)^(e - 1); a[n_] := (m = Times @@ f @@@ FactorInteger[n]) / GCD[n, m]; Array[a, 100] (* Amiram Eldar, Oct 20 2021 *)
|
|
PROG
|
(PARI)
A003968(n) = {my(f=factor(n)); for (i=1, #f~, p= f[i, 1]; f[i, 1] = p*(p+1)^(f[i, 2]-1); f[i, 2] = 1); factorback(f); }
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|