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 A119379 #14 Feb 13 2021 06:28:17
%S A119379 146,206,262,326,562,626,718,766,802,818,898,926,934,982,1046,1186,
%T A119379 1318,1346,1418,1438,1522,1538,1642,1718,1766,1774,1822,1838,1894,
%U A119379 2062,2078,2098,2174,2218,2258,2302,2306,2446,2498,2518,2602,2606,2614,2642,2762
%N A119379 Untouchable semiprimes: semiprimes which are not the sum of the aliquot parts of any number.
%C A119379 From _Amiram Eldar_, Feb 13 2021: (Start)
%C A119379 Assuming that 5 is the only odd untouchable number, all the terms are of the form 2*p, where p is a prime.
%C A119379 Alanen (1972) calculated the first 70 terms of this sequence (terms below 5000). (End).
%H A119379 Amiram Eldar, <a href="/A119379/b119379.txt">Table of n, a(n) for n = 1..9035</a> (terms below 10^6, calculated using data from Giovanni Resta; terms 1..1000 from Donovan Johnson)
%H A119379 Jack David Alanen, <a href="https://ir.cwi.nl/pub/9143">Empirical study of aliquot series</a>, Ph.D Thesis, Yale University, 1972.
%H A119379 Giovanni Resta, <a href="http://www.numbersaplenty.com/set/untouchable_number/">Untouchable numbers</a> (includes a list of the 150232 untouchable numbers below 10^6).
%t A119379 seq[max_] := Module[{v = Table[0, {max}]}, Do[k = DivisorSigma[1, n] - n; If[2 <= k <= max, v[[k]]++], {n, 1, max^2}]; Select[Rest[Position[v, _?(# == 0 &)] // Flatten], PrimeOmega[#] == 2 &]]; seq[1000] (* _Amiram Eldar_, Feb 13 2021 *)
%Y A119379 Intersection of A001358 and A005114.
%K A119379 nonn
%O A119379 1,1
%A A119379 _Tanya Khovanova_, Jul 24 2006
%E A119379 More terms from _Franklin T. Adams-Watters_ and _Don Reble_, Jul 28 2006