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 A158458 #14 Dec 20 2021 12:46:15
%S A158458 2,8,9,15,20,21,28,32,35,39,44,48,50,51,57,65,68,69,70,76,77,87,95,98,
%T A158458 108,110,111,124,129,135,148,154,155,161,162,164,168,170,176,177,188,
%U A158458 189,190,192,209,221,225,230,236,237,238,249,252,264,266,267,268,272,290
%N A158458 Numbers k such that k + bigomega(k) is prime.
%C A158458 2 is the only prime number in the sequence. - _Michel Lagneau_, May 17 2010
%H A158458 Eric Chen, <a href="/A158458/b158458.txt">Table of n, a(n) for n = 1..10000</a>
%F A158458 {k: k+A001222(k) in A000040}.
%e A158458 a(2) = 8 = 2*2*2; 8+3 = 11 is prime.
%e A158458 a(3) = 9 = 3*3; 9+2 = 11 is prime.
%e A158458 a(4) = 15 = 3*5; 15+2 = 17 is prime.
%p A158458 for k from 2 to 400 do if isprime(k+numtheory[bigomega](k)) then printf("%d,",k) ; fi; od: # _R. J. Mathar_, May 19 2009, May 23 2010
%t A158458 Select[Range[10^3], PrimeQ[ # + Plus @@ Last /@ FactorInteger[ # ]] &] (* _Michel Lagneau_, May 17 2010 *)
%t A158458 Select[Range[300],PrimeQ[#+PrimeOmega[#]]&] (* _Harvey P. Dale_, Dec 20 2021 *)
%o A158458 (PARI) is(n)=isprime(n+bigomega(n)) \\ _Eric Chen_, Jun 13 2018
%Y A158458 Cf. A000040, A001222.
%Y A158458 Cf. A067532, A078762, A068080. - _Michel Lagneau_, May 17 2010
%K A158458 nonn
%O A158458 1,1
%A A158458 _Juri-Stepan Gerasimov_, Mar 19 2009
%E A158458 191 replaced with 192 and extended by _R. J. Mathar_, May 19 2009
%E A158458 Generalized (by inserting a(1)=2) by _Michel Lagneau_, May 17 2010