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 A321493 #16 Apr 21 2025 12:40:19
%S A321493 714,1364,1595,1770,1785,1869,2001,2090,2145,2184,2210,2261,2345,2379,
%T A321493 2414,2639,2805,2820,2849,2870,2925,3002,3009,3059,3080,3219,3255,
%U A321493 3289,3354,3366,3444,3450,3485,3534,3654,3689,3705
%N A321493 Numbers m such that m and m+1 both have at least 3, but m or m+1 has at least 4 distinct prime factors.
%C A321493 A321503 lists numbers m such that m and m+1 both have at least 3 distinct prime factors, while A140077 lists numbers such that m and m+1 have exactly 3 distinct prime factors. This sequence is the complement of the latter in the former, it consists of terms with indices (15, 60, 82, 98, 99, 104, ...) of the former.
%C A321493 Since m and m+1 can't share a prime factor, we have a(n)*(a(n)+1) >= p(3+4)# = A002110(7). Remarkably enough, a(1) = A000196(A002110(3+4)) exactly!
%H A321493 M. F. Hasler, <a href="/A321493/b321493.txt">Table of n, a(n) for n = 1..5000</a>
%F A321493 A321503 \ A140077.
%t A321493 aQ[n_]:=Module[{v={PrimeNu[n],PrimeNu[n+1]}},Min[v]>2 && v!={3,3}]; Select[Range[120000], aQ] (* _Amiram Eldar_, Nov 12 2018 *)
%t A321493 dpfQ[{a_,b_}]:=a>2&&b>2&&(a>3||b>3); Position[Partition[PrimeNu[Range[4000]],2,1],_?dpfQ]//Flatten (* _Harvey P. Dale_, Apr 21 2025 *)
%o A321493 (PARI) select( is(n)=omega(n)>2&&omega(n+1)>2&&(omega(n)>3||omega(n+1)>3), [1..1300])
%Y A321493 Cf. A140077, A321503.
%Y A321493 Cf. A321494, A321495, A321496, A321497 (analog for 4, 5, 6, 7 factors).
%K A321493 nonn
%O A321493 1,1
%A A321493 _M. F. Hasler_, Nov 13 2018