This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A353668 #9 May 07 2022 16:33:49 %S A353668 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 A353668 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 A353668 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 A353668 a(n) = A351546(n) / gcd(n, A351546(n)). %H A353668 Antti Karttunen, <a href="/A353668/b353668.txt">Table of n, a(n) for n = 1..16384</a> %H A353668 Antti Karttunen, <a href="/A353668/a353668.txt">Data supplement: n, a(n) computed for n = 1..65537</a> %H A353668 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a> %H A353668 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a> %o A353668 (PARI) %o A353668 A003961(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); }; %o A353668 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 A353668(n) = { my(u=A351546(n)); (u / gcd(n, u)); }; %Y A353668 Cf. A351552 (positions of 1's). %K A353668 nonn %O A353668 1,3 %A A353668 _Antti Karttunen_, May 04 2022