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!)
A344697 a(n) = A001615(n) / gcd(sigma(n), A001615(n)). 9

%I #15 May 29 2021 20:01:21

%S 1,1,1,6,1,1,1,4,12,1,1,6,1,1,1,24,1,12,1,6,1,1,1,4,30,1,9,6,1,1,1,16,

%T 1,1,1,72,1,1,1,4,1,1,1,6,12,1,1,24,56,30,1,6,1,9,1,4,1,1,1,6,1,1,12,

%U 96,1,1,1,6,1,1,1,48,1,1,30,6,1,1,1,24,108,1,1,6,1,1,1,4,1,12,1,6,1,1,1,16,1,56,12,180

%N a(n) = A001615(n) / gcd(sigma(n), A001615(n)).

%C This is not multiplicative. The first point where a(m*n) = a(m)*a(n) does not hold for coprime m and n is 108 = 4*27, where a(108) = 27, although a(4) = 6 and a(27) = 9. See A344702.

%H Antti Karttunen, <a href="/A344697/b344697.txt">Table of n, a(n) for n = 1..10404</a>

%H Antti Karttunen, <a href="/A344697/a344697.txt">Data supplement: n, a(n) computed for n = 1..65537</a>

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

%F a(n) = A001615(n) / A344695(n).

%o (PARI)

%o A001615(n) = if(1==n,n, my(f=factor(n)); prod(i=1, #f~, f[i, 1]^f[i, 2] + f[i, 1]^(f[i, 2]-1))); \\ After code in A001615

%o A344697(n) = { my(u=A001615(n)); (u/gcd(u,sigma(n))); };

%Y Cf. A000203, A001615, A005117, A344695, A344696, A344699, A344702.

%Y Cf. also A344757.

%K nonn

%O 1,4

%A _Antti Karttunen_, May 26 2021

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 18 21:02 EDT 2024. Contains 374388 sequences. (Running on oeis4.)