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 A344699 #9 May 28 2021 17:42:19
%S A344699 1,1,1,6,1,6,1,4,72,6,1,4,1,6,72,24,1,48,1,4,72,6,1,24,2160,6,18,4,1,
%T A344699 48,1,16,72,6,2160,288,1,6,72,24,1,48,1,4,18,6,1,16,5760,288,72,4,1,
%U A344699 108,2160,24,72,6,1,288,1,6,18,96,2160,48,1,4,72,288,1,64,1,6,108,4,5760,48,1,16,2592,6,1,288,2160
%N A344699 a(n) = A344697(A108951(n)).
%H A344699 Antti Karttunen, <a href="/A344699/b344699.txt">Table of n, a(n) for n = 1..10201</a>
%H A344699 <a href="/index/Pri#primorial_numbers">Index entries for sequences related to primorial numbers</a>
%H A344699 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%o A344699 (PARI)
%o A344699 A034386(n) = prod(i=1, primepi(n), prime(i));
%o A344699 A108951(n) = { my(f=factor(n)); prod(i=1, #f~, A034386(f[i, 1])^f[i, 2]) };
%o A344699 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 A344699 A344697(n) = { my(u=A001615(n)); (u/gcd(u,sigma(n))); };
%o A344699 A344699(n) = A344697(A108951(n));
%Y A344699 Cf. A000203, A001615, A108951, A337203, A344697, A344698, A344701 (apparently positions of records).
%K A344699 nonn
%O A344699 1,4
%A A344699 _Antti Karttunen_, May 26 2021