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 A088986 #44 May 12 2025 10:13:30
%S A088986 54,91,92,115,141,142,143,144,158,205,212,213,214,215,295,301,323,324,
%T A088986 325,391,535,685,721,799,1135,1345,1465,1535,1711,1941,1981,2101,2215,
%U A088986 2302,2303,2304,2425,2641,3865,4411,5461,6505,6625,6925,7165,7231,7261
%N A088986 Numbers k such that each of k through k+4 are divisible by exactly two primes.
%C A088986 Identical with A045933 from first-to 38th terms, but deviates later because A045933 includes start of chains with more than 2 prime-factors.
%C A088986 Contrary to longer chains (6, 7, 8, ...) of omega = 2 this sequence seems to be either infinite or very long. See comments in A088983 [especially Eggleton via Kimberley, 2017].
%C A088986 Primes counted without multiplicity. - _Harvey P. Dale_, Oct 20 2011
%H A088986 Amiram Eldar, <a href="/A088986/b088986.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..750 from Harvey P. Dale)
%t A088986 Transpose[Select[Partition[Transpose[Select[Table[{n,PrimeNu[n]},{n,10000}],Last[#]==2&]][[1]],5,1],Last[#]-First[#]==4&]][[1]] (* _Harvey P. Dale_, Oct 20 2011 *)
%o A088986 (Python)
%o A088986 from sympy import primefactors
%o A088986 def ok(n):
%o A088986 return all(len(primefactors(n + i))==2 for i in range(5))
%o A088986 print([n for n in range(1, 8001) if ok(n)]) # _Indranil Ghosh_, Jul 17 2017
%o A088986 (PARI) lista(kmax) = {my(q = vector(5)); for(k = 6, kmax, q = concat(vecextract(q, "^1"), omega(k) == 2); if(vecmin(q) == 1, print1(k-4, ", ")));} \\ _Amiram Eldar_, Jul 11 2024
%Y A088986 Cf. A001221, A045933, A088983.
%K A088986 nonn
%O A088986 1,1
%A A088986 _Labos Elemer_, Sep 30 2003