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 A325827 #16 Jan 14 2020 10:00:00
%S A325827 1,1,1,1,1,12,1,1,1,1,1,4,1,4,3,1,1,3,1,1,1,4,1,3,5,1,1,28,1,3,1,1,3,
%T A325827 1,1,4,1,1,1,10,14,12,1,4,3,1,1,4,5,1,3,5,1,12,1,4,1,1,1,12,5,4,1,1,1,
%U A325827 48,1,1,3,16,1,3,5,1,5,4,1,12,1,1,1,14,1,28,1,1,3,1,1,9,16,1,5,1,1,12,5,11,3,1,34,12,1,5,3
%N A325827 a(n) = A325825(2*n, sigma(n)).
%C A325827 See also comment in A325808.
%H A325827 Antti Karttunen, <a href="/A325827/b325827.txt">Table of n, a(n) for n = 1..20000</a>
%F A325827 a(n) = A325825(2*n, A000203(n)).
%o A325827 (PARI)
%o A325827 A004488(n) = subst(Pol(apply(x->(3-x)%3, digits(n, 3)), 'x), 'x, 3);
%o A325827 A325825sq(a,b) = { my(a=fromdigits(Vec(lift(gcd(Pol(digits(a,3))*Mod(1, 3),Pol(digits(b,3))*Mod(1, 3)))),3), b=A004488(a)); min(a,b); };
%o A325827 A325827(n) = A325825sq(n+n, sigma(n));
%Y A325827 Cf. A000203, A325808, A325825.
%Y A325827 Cf. also A325635, A325636.
%K A325827 nonn
%O A325827 1,6
%A A325827 _Antti Karttunen_, May 22 2019
%E A325827 Terms corrected to agree with the new corrected definition of A325825. - _Antti Karttunen_, Jan 11 2020