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 A366795 #7 Oct 26 2023 13:22:19
%S A366795 1,3,4,1,6,12,1,3,8,18,24,4,1,3,4,1,12,24,32,6,48,72,6,12,1,3,4,1,6,
%T A366795 12,1,3,14,36,48,8,72,96,8,18,96,144,192,24,8,18,24,4,1,3,4,1,6,12,1,
%U A366795 3,8,18,24,8,1,3,4,1,18,42,56,12,84,144,12,24,112,216,288,32,12,24,32,6,168,288,384,48,576,576
%N A366795 a(n) = A344695(A005940(1+n)), where A344695(n) = gcd(psi(n), sigma(n)), and A005940 is the Doudna sequence.
%H A366795 Antti Karttunen, <a href="/A366795/b366795.txt">Table of n, a(n) for n = 0..16384</a>
%o A366795 (PARI)
%o A366795 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 A366795 A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); (t); };
%o A366795 A344695(n) = gcd(sigma(n), A001615(n));
%o A366795 A366795(n) = A344695(A005940(1+n));
%Y A366795 Cf. A005940, A344695, A366796 (rgs-transform).
%Y A366795 Cf. also A346471, A366801, A366803.
%K A366795 nonn
%O A366795 0,2
%A A366795 _Antti Karttunen_, Oct 26 2023