login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A353804 Greatest common divisor of sigma(sigma(n)) and Product_{p^e||n} sigma(sigma(p^e)), where n = Product_{p^e||n}, with each p^e the maximal power of prime p that divides n. 6

%I #8 May 09 2022 11:02:52

%S 1,4,7,8,12,28,15,24,14,3,28,56,24,60,12,32,39,56,42,96,21,7,60,168,

%T 32,96,90,120,72,3,63,104,4,12,4,112,60,168,24,18,96,84,84,224,168,15,

%U 124,224,80,128,39,3,120,360,3,360,6,18,168,96,96,252,210,128,32,1,126,312,84,1,195,336,114,240,224,336

%N Greatest common divisor of sigma(sigma(n)) and Product_{p^e||n} sigma(sigma(p^e)), where n = Product_{p^e||n}, with each p^e the maximal power of prime p that divides n.

%H Antti Karttunen, <a href="/A353804/b353804.txt">Table of n, a(n) for n = 1..20000</a>

%H <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>

%F a(n) = gcd(A051027(n), A353802(n)) = gcd(A051027(n), A353803(n)) = gcd(A353802(n), A353803(n)).

%o (PARI)

%o A051027(n) = sigma(sigma(n));

%o A353804(n) = { my(f = factor(n)); gcd(A051027(n), prod(k=1, #f~, A051027(f[k, 1]^f[k, 2]))); };

%Y Cf. A000203, A051027, A353802, A353803, A353805, A353806.

%Y Cf. also A353754.

%K nonn,look

%O 1,2

%A _Antti Karttunen_, May 08 2022

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 26 06:58 EDT 2024. Contains 374615 sequences. (Running on oeis4.)