|
%I #27 Jul 23 2022 10:12:22
%S 1,3,1,1,1,3,1,3,1,3,1,1,1,3,1,1,1,3,1,21,1,3,1,15,1,3,5,1,1,3,1,9,1,
%T 3,1,1,1,3,1,9,1,3,1,3,1,3,1,1,1,3,1,1,1,15,1,3,5,3,1,21,1,3,1,1,7,3,
%U 1,9,1,3,1,15,1,3,1,1,1,3,1,3,1,3,1,1,1,3,5,9,1,3,1,3,1,3,1,9,1,3,13,7,1,3,1,3,1
%N a(n) = gcd(sigma(n), A003961(n)), where A003961 is fully multiplicative with a(prime(k)) = prime(k+1), and sigma is the sum of divisors of n.
%H Antti Karttunen, <a href="/A342671/b342671.txt">Table of n, a(n) for n = 1..16384</a>
%H <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F a(n) = gcd(A000203(n), A003961(n)).
%F a(n) = gcd(A000203(n), A286385(n)) = gcd(A003961(n), A286385(n)).
%F a(n) = A341529(n) / A342672(n).
%F From _Antti Karttunen_, Jul 21 2022: (Start)
%F a(n) = A003961(n) / A349161(n).
%F a(n) = A000203(n) / A349162(n).
%F a(n) = A161942(n) / A348992(n).
%F a(n) = A003961(A349163(n)) = A003961(n/A349164(n)).
%F (End)
%o (PARI)
%o A003961(n) = { my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };
%o A342671(n) = gcd(sigma(n), A003961(n));
%Y Cf. A000203, A003961, A161942, A286385, A341529, A342672, A342673, A348992, A349161, A349162, A349163, A349164, A349165 (positions of 1's), A349166 (of terms > 1), A349167, A349756, A350071 [= a(n^2)], A355828 (Dirichlet inverse).
%Y Cf. A349169, A349745, A355833, A355924 (applied onto prime shift array A246278).
%Y Cf. also A336850, A354827/A354828, A355932.
%K nonn
%O 1,2
%A _Antti Karttunen_, Mar 20 2021
|
