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 A349000 #15 Nov 13 2021 22:32:38
%S A349000 1,1,1,6,1,6,1,2,3,6,15,90,1,2,1,6,5,30,1,2,3,6,45,90,1,2,1,6,5,30,1,
%T A349000 2,1,6,1,6,1,2,3,6,15,90,1,2,1,6,5,30,7,14,21,42,315,630,1,2,1,6,5,30,
%U A349000 1,2,1,6,1,6,5,10,15,30,15,90,25,50,25,150,25,150,175,350,525,1050,7875,15750,25,50,25,150,125,750
%N A349000 a(n) = A323166(A276086(n)), where A323166(n) = gcd(n, usigma(n)), usigma (A034448) is multiplicative with a(p^e) = (p^e)+1, and A276086 gives the prime product form of primorial base expansion of n.
%H A349000 Antti Karttunen, <a href="/A349000/b349000.txt">Table of n, a(n) for n = 0..11550</a>
%H A349000 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>
%F A349000 a(n) = A323166(A276086(n)) = gcd(A276086(n), A348996(n)).
%o A349000 (PARI) A349000(n) = { my(m1=1, m2=1, p=2, u); while(n, if(n%p, u = p^(n%p); m1 *= u; m2 *= (1+u)); n = n\p; p = nextprime(1+p)); gcd(m1,m2); };
%Y A349000 Cf. A034448, A276086, A323166, A348996, A348997, A348999.
%K A349000 nonn,base,look
%O A349000 0,4
%A A349000 _Antti Karttunen_, Nov 07 2021