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 A071227 #15 Apr 29 2025 04:44:32
%S A071227 1,1,1,2,1,2,2,2,4,6,4,2,4,6,10,4,12,6,8,10,16,18,12,4,22,16,20,18,28,
%T A071227 4,30,6,22,8,36,40,42,28,8,30,46,8,10,52,42,36,16,20,12,58,8,60,40,12,
%U A071227 42,66,12,46,70,72,20,16,100,78,52,16,82,12,18,58,88,8,60,96,20,66,100
%N A071227 Number of solutions 1<=x<=m to gcd(m,x) = tau(m) where m = A033950(n).
%H A071227 Amiram Eldar, <a href="/A071227/b071227.txt">Table of n, a(n) for n = 1..10000</a>
%t A071227 s[n_] := Module[{d = DivisorSigma[0, n]}, If[Divisible[n, d], Count[Range[n], _?(GCD[n, #] == d &)], Nothing]]; Array[s, 1000] (* _Amiram Eldar_, Apr 29 2025 *)
%o A071227 (PARI) for(n=1,1000,if(sum(i=1,n,if(gcd(n,i)-numdiv(n),0,1))>0,print1(sum(i=1,n,if(gcd(n,i)-numdiv(n),0,1)),",")))
%Y A071227 Cf. A000005 (tau), A033950.
%K A071227 easy,nonn
%O A071227 1,4
%A A071227 _Benoit Cloitre_, Jun 10 2002
%E A071227 Name corrected by _Sean A. Irvine_, Jul 05 2024