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 A252760 #11 Mar 25 2017 14:25:41
%S A252760 0,1,2,4,9,10,12,72,112,33,12,212,42,22,108,96,35,456,6,1912,714,220,
%T A252760 60,5364,4032,747,448,3944,762,24370,8,5376,738,8148,996,253568,1143,
%U A252760 242,980,46032,248,65138,56,23004,195768,282,28,386736,327520,12102,24366
%N A252760 Number of moduli m such that the multiplicative order of n mod m equals n.
%F A252760 a(n) = |{m : multiplicative order of n mod m = n}|.
%F A252760 a(n) = Sum_{d|n} mu(n/d)*tau(n^d-1), mu = A008683, tau = A000005.
%p A252760 with(numtheory):
%p A252760 a:= n-> add(mobius(n/d)*tau(n^d-1), d=divisors(n)):
%p A252760 seq(a(n), n=1..30);
%t A252760 a[n_] := DivisorSum[n, MoebiusMu[n/#]*DivisorSigma[0, n^#-1]&]; a[1] = 0;
%t A252760 Table[an = a[n]; Print["a(", n, ") = ", an]; an, {n, 1, 46}] (* _Jean-François Alcover_, Mar 25 2017, translated from Maple *)
%o A252760 (PARI) a(n) = if (n==1, 1, sumdiv(n, d, moebius(n/d)*numdiv(n^d-1))); \\ _Michel Marcus_, Mar 25 2017
%Y A252760 Main diagonal of A212957.
%Y A252760 Cf. A000005, A008683.
%K A252760 nonn
%O A252760 1,3
%A A252760 _Alois P. Heinz_, Dec 21 2014