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 A060662 #11 Nov 18 2024 02:54:45
%S A060662 168,252,288,384,768,1248,1584,1860,2052,2480,2904,3906,3968,4116,
%T A060662 4176,4224,4256,4284,4392,4416,4620,5824,5850,5856,5928,6084,6192,
%U A060662 6216,6600,6636,6660,6888,6944,7104,7182,7308,7840,7992,8184,8976,9114,9480,9856
%N A060662 Numbers k such that sigma(x) = k has exactly 6 solutions.
%H A060662 Robert Israel, <a href="/A060662/b060662.txt">Table of n, a(n) for n = 1..10000</a>
%H A060662 Max Alekseyev, <a href="https://oeis.org/wiki/User:Max_Alekseyev/gpscripts">PARI/GP Scripts for Miscellaneous Math Problems</a> (invphi.gp).
%e A060662 168 = sigma(60) = sigma(78) = sigma(92) = sigma(123) = sigma(143) = sigma(167).
%p A060662 N:= 10^4: # for terms <= N
%p A060662 V:= Vector(N):
%p A060662 for n from 1 to N-1 do
%p A060662 s:= numtheory:-sigma(n);
%p A060662 if s <= N then V[s]:= V[s]+1 fi
%p A060662 od:
%p A060662 select(t -> V[t]=6, [$1..N]); # _Robert Israel_, Nov 21 2019
%t A060662 a = Table[ 0, {10000} ]; Do[ s = DivisorSigma[ 1, n ]; If[ s < 10001, a[ [ s ] ]++ ], {n, 1, 10000} ]; Select[ Range[ 10000 ], a[ [ # ] ] == 6 & ]
%o A060662 (PARI) is(k) = invsigmaNum(k) == 6 \\ _Amiram Eldar_, Nov 18 2024, using _Max Alekseyev_'s invphi.gp
%Y A060662 Cf. A000203.
%Y A060662 Number of solutions: A007369 (0), A007370 (1), A007371 (2), A007372 (3), A060660 (4), A060661 (5), this sequence (6), A060663 (7), A060664 (8), A060665 (9), A060666 (10), A060678 (11), A060676 (12).
%K A060662 nonn
%O A060662 1,1
%A A060662 _Robert G. Wilson v_, Apr 18 2001