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 A346471 #12 Aug 16 2021 22:48:28
%S A346471 1,3,4,12,1,3,6,18,24,72,6,18,1,3,4,12,1,3,6,18,24,72,12,36,1,3,4,12,
%T A346471 1,3,8,24,32,96,8,24,48,144,192,576,48,144,8,24,32,96,8,24,48,144,192,
%U A346471 576,96,288,8,24,32,96,8,24,1,3,4,12,3,9,6,18,24,72,18,54,3,9,12,36,3,9,12,36,48,144,36,108,3,9,12,36
%N A346471 a(n) = A344695(A276086(n)), where A344695(x) = gcd(psi(x), sigma(x)), and A276086 gives the prime product form of primorial base expansion of n.
%H A346471 Antti Karttunen, <a href="/A346471/b346471.txt">Table of n, a(n) for n = 0..11550</a>
%H A346471 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%H A346471 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A346471 a(n) = A344695(A276086(n)) = gcd(A324653(n), A346470(n)).
%o A346471 (PARI)
%o A346471 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 A346471 A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
%o A346471 A344695(n) = gcd(sigma(n), A001615(n));
%o A346471 A346471(n) = A344695(A276086(n));
%Y A346471 Cf. A000203, A001615, A276086, A324653, A344695, A346470.
%Y A346471 Cf. also A346469.
%K A346471 nonn,base,look
%O A346471 0,2
%A A346471 _Antti Karttunen_, Jul 21 2021