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!)
A353668 a(n) = A351546(n) / gcd(n, A351546(n)). 5

%I #9 May 07 2022 16:33:49

%S 1,1,4,7,6,2,8,5,13,1,12,7,14,4,8,31,18,13,20,1,32,2,24,1,31,7,8,2,30,

%T 4,32,7,16,1,48,91,38,10,56,1,42,16,44,7,26,4,48,31,57,31,24,49,54,4,

%U 72,5,16,5,60,2,62,16,104,127,12,8,68,7,32,8,72,13,74,19,124,35,96,28,80,31,121,7,84,8,108,22,8

%N a(n) = A351546(n) / gcd(n, A351546(n)).

%H Antti Karttunen, <a href="/A353668/b353668.txt">Table of n, a(n) for n = 1..16384</a>

%H Antti Karttunen, <a href="/A353668/a353668.txt">Data supplement: n, a(n) computed for n = 1..65537</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>

%o (PARI)

%o A003961(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); };

%o A351546(n) = { my(f=factor(sigma(n)), u=A003961(n)); prod(k=1, #f~, f[k, 1]^((0!=(u%f[k, 1]))*f[k, 2])); };

%o A353668(n) = { my(u=A351546(n)); (u / gcd(n, u)); };

%Y Cf. A351552 (positions of 1's).

%K nonn

%O 1,3

%A _Antti Karttunen_, May 04 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 August 17 04:34 EDT 2024. Contains 375200 sequences. (Running on oeis4.)