login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A348039
a(n) = gcd(A003557(n), A327564(n)).
6
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 6
OFFSET
1,36
COMMENTS
There is interesting regularity in the scatter plot.
LINKS
FORMULA
a(n) = gcd(A003557(n), A327564(n)).
a(n) = A348036(n) / A007947(n).
a(n) = A003557(n) / A348037(n).
a(n) = A327564(n) / A348038(n).
MATHEMATICA
{1}~Join~Array[GCD @@ Map[Times @@ # &, Transpose@ Map[{#1^(#2 - 1), (#1 + 1)^(#2 - 1)} & @@ # &, FactorInteger[#]]] &, 105, 2] (* Michael De Vlieger, 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); }
A007947(n) = factorback(factorint(n)[, 1]);
A348036(n) = gcd(n, A003968(n));
A348039(n) = (A348036(n)/A007947(n));
(PARI)
A003557(n) = (n/factorback(factorint(n)[, 1]));
A327564(n) = { my(f=factor(n)); for(k=1, #f~, f[k, 1]++; f[k, 2]--); factorback(f); }; \\ From A327564
A348039(n) = gcd(A003557(n), A327564(n));
CROSSREFS
Cf. A347960 (positions of terms > 1).
Sequence in context: A331277 A369458 A257936 * A143532 A348947 A267426
KEYWORD
nonn,look
AUTHOR
Antti Karttunen, Oct 19 2021
STATUS
approved