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 A321496 #12 Nov 13 2018 12:47:41
%S A321496 58524465,64822394,130578734,133595384,143489709,153124685,155197965,
%T A321496 156532089,157955720,159653409,165706904,169075829,170118234,
%U A321496 175458920,184867605,188377475,193042394,194236679,195719810,199150665,202429590,208727805,209801514,211588454
%N A321496 Numbers k such that k and k+1 have at least 6 but not both exactly 6 distinct prime factors.
%C A321496 Complement of A273879 (k and k+1 have exactly 6 distinct prime factors) in A321506 (k and k+1 have at least 6 distinct prime factors).
%F A321496 A321506 \ A273879.
%t A321496 aQ[n_]:=Module[{v={PrimeNu[n], PrimeNu[n+1]}}, Min[v]>5 && v!={6, 6}]; Select[Range[10^9], aQ] (* _Amiram Eldar_, Nov 12 2018 *)
%o A321496 (PARI) is(n)=omega(n)>5&&omega(n+1)>5&&(omega(n)>6||omega(n+1)>6)
%Y A321496 Cf. A273879, A321506; A321495 (analog for 5 factors).
%K A321496 nonn
%O A321496 1,1
%A A321496 _M. F. Hasler_, Nov 12 2018
%E A321496 More terms from _Amiram Eldar_, Nov 12 2018