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 A157489 #11 Sep 23 2021 17:37:24
%S A157489 275,373,445,755,985,1165,1245,1475,1535,1643,1645,1705,1715,1745,
%T A157489 2219,2305,2317,2389,2445,2455,2543,2579,2845,2855,2893,3229,3299,
%U A157489 3325,3371,3565,3613,3659,3695,3757,3829,3875,4255,4285,4295,4345,4355,4477,4745,5003,5065
%N A157489 Numbers n such that n-+5 are divisible by exactly 5 primes, counted with multiplicity.
%C A157489 Let a, b and 10 be pairwise coprime, with A001222(a) = A001222(b) = 4. There exists c such that c == 5 (mod a) and c == -5 (mod b). Dickson's conjecture implies that (c+k*a*b-5)/a and (c+k*a*b+5)/b are prime for infinitely many k; for such k, c+k*a*b is in the sequence. - _Robert Israel_, Mar 22 2020
%H A157489 Robert Israel, <a href="/A157489/b157489.txt">Table of n, a(n) for n = 1..10000</a>
%p A157489 N:= 10^4: # for terms <= N
%p A157489 T5:= select(t -> numtheory:-bigomega(t)=5, {$1..N+5}):
%p A157489 S:= T5 intersect map(`+`,T5,10):
%p A157489 sort(convert(map(`-`,S,5),list)); # _Robert Israel_, Mar 22 2020
%t A157489 q=5;lst={};Do[If[Plus@@Last/@FactorInteger[n-q]==q&&Plus@@Last/@FactorInteger[n+q]==q,AppendTo[lst,n]],{n,8!}];lst
%t A157489 SequencePosition[PrimeOmega[Range[5100]],{5,_,_,_,_,_,_,_,_,_,5}][[All,1]]+5 (* _Harvey P. Dale_, Sep 23 2021 *)
%Y A157489 Cf. A001222, A124936, A014612, A157483, A157484, A157485, A157486
%K A157489 nonn
%O A157489 1,1
%A A157489 _Vladimir Joseph Stephan Orlovsky_, Mar 01 2009