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 A335652 #29 Jul 04 2021 13:49:14
%S A335652 7,11,15,17,19,29,35,39,41,43,55,67,87,97,101,109,113,134,137,155,163,
%T A335652 173,175,181,183,203,207,209,211,219,229,241,242,247,249,257,259,279,
%U A335652 281,283,295,305,314,317,327,329,331,337,339,341,351,353,371,373,401,404,409,413,433,455
%N A335652 Numbers k such that Omega(k+1) = Omega(k) + 2, where Omega(k) = A001222(k) is the number of prime factors of k with multiplicity.
%H A335652 Harvey P. Dale, <a href="/A335652/b335652.txt">Table of n, a(n) for n = 1..1000</a>
%e A335652 7 is prime, Omega(7) = 1, 7 + 1 = 8 = 2*2*2, Omega(8) = 3.
%p A335652 Omegas:= [seq(numtheory:-bigomega(i),i=1..1001)]:
%p A335652 select(i -> Omegas[i]+2=Omegas[i+1], [$1..1000]); # _Robert Israel_, Jun 16 2020
%t A335652 m = 2; s = {}; Do[If[PrimeOmega[x + 1] == PrimeOmega[x] + m, AppendTo[s, x]], {x, 500}]; s
%t A335652 Position[Partition[PrimeOmega[Range[500]],2,1],_?(#[[1]]==#[[2]]-2&),1,Heads-> False]//Flatten (* _Harvey P. Dale_, Jul 04 2021 *)
%Y A335652 Omega(k+1) = Omega(k) + m: A045920 (m = 0), A076156 (m = 1).
%Y A335652 Cf. A001222, A335655. Contains A063639.
%K A335652 nonn
%O A335652 1,1
%A A335652 _Zak Seidov_, Jun 16 2020