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 A239611 #26 Aug 08 2018 04:31:41
%S A239611 1,4,16,32,32,64,96,192,216,128,240,512,288,384,512,1024,512,864,720,
%T A239611 1024,1536,960,1056,3072,1200,1152,2592,3072,1568,2048,1920,5120,3840,
%U A239611 2048,3072,6912,2592,2880,4608,6144,3200,6144,3696,7680,6912,4224,4416
%N A239611 a(n) = Sum_{0 < x,y <= n and gcd(x^2 + y^2, n)=1} gcd(x^2 + y^2 - 1, n).
%C A239611 Related to Menon's identity. See Conclusions and further work section of the arXiv file linked.
%C A239611 Multiplicative by the Chinese remainder theorem since gcd(x, m*n) = gcd(x, m)*gcd(x, n) for gcd(m, n) = 1. - _Andrew Howroyd_, Aug 07 2018
%H A239611 Antti Karttunen, <a href="/A239611/b239611.txt">Table of n, a(n) for n = 1..2101</a>
%H A239611 C. Calderón, J. M. Grau, A. Oller-Marcen, L. Toth, <a href="http://arxiv.org/abs/1403.7878">Counting invertible sums of squares modulo n and a new generalization of Euler totient function</a>, arXiv:1403.7878 [math.NT], 2014.
%t A239611 g2[n_] := Sum[If[GCD[x^2 + y^2, n] == 1, GCD[x^2 + y^2 - 1, n], 0], {x, 1, n}, {y, 1, n}]; Array[g2,100]
%o A239611 (PARI) a(n) = {s = 0; for (x=1, n, for (y=1, n, if (gcd(x^2+y^2,n) == 1, s += gcd(x^2+y^2-1,n)););); s;} \\ _Michel Marcus_, Jun 29 2014
%Y A239611 Cf. A239612, A239613, A239614, A239615, A079458, A053191, A227499, A244342.
%K A239611 nonn,mult
%O A239611 1,2
%A A239611 _José María Grau Ribas_, Jun 24 2014