|
|
A348929
|
|
a(n) = gcd(n, A003959(n)), where A003959 is multiplicative with a(p^e) = (p+1)^e.
|
|
4
|
|
|
1, 1, 1, 1, 1, 6, 1, 1, 1, 2, 1, 12, 1, 2, 3, 1, 1, 6, 1, 2, 1, 2, 1, 12, 1, 2, 1, 4, 1, 6, 1, 1, 3, 2, 1, 36, 1, 2, 1, 2, 1, 6, 1, 4, 3, 2, 1, 12, 1, 2, 3, 2, 1, 6, 1, 8, 1, 2, 1, 12, 1, 2, 1, 1, 1, 6, 1, 2, 3, 2, 1, 72, 1, 2, 3, 4, 1, 6, 1, 2, 1, 2, 1, 12, 1, 2, 3, 4, 1, 18, 7, 4, 1, 2, 5, 12, 1, 2, 3, 4, 1, 6, 1, 2, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
f[p_, e_] := (p + 1)^e; a[n_] := GCD[n, Times @@ f @@@ FactorInteger[n]]; Array[a, 100] (* Amiram Eldar, Nov 07 2021 *)
|
|
PROG
|
(PARI)
A003959(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1]++); factorback(f); };
|
|
CROSSREFS
|
Differs from similar A126795 for the first time at n=36, where a(36) = 36, while A126795(36) = 12.
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|