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 A321503 #28 Jan 25 2025 00:14:02
%S A321503 230,285,429,434,455,494,560,594,609,615,644,645,650,665,714,740,741,
%T A321503 759,804,805,819,825,854,860,884,902,935,945,969,986,987,1001,1014,
%U A321503 1022,1034,1035,1044,1064,1065,1070,1085,1104,1105,1130,1196,1209,1220,1221,1235,1239,1245,1265
%N A321503 Numbers m such that m and m+1 both have at least 3 distinct prime factors.
%C A321503 Disjoint union of A140077 (omega({m, m+1}) = {3}) and A321493 (not both have exactly 3 prime divisors). The latter contains terms with indices {15, 60, 82, 98, 99, 104, ...} of this sequence.
%C A321503 Numbers m and m+1 can never have a common prime factor (consider them mod p), therefore the terms are > sqrt(A002110(3+3)), A002110 = primorial.
%H A321503 M. F. Hasler, <a href="/A321503/b321503.txt">Table of n, a(n) for n = 1..10000</a>
%F A321503 a(n) ~ n. - _Charles R Greathouse IV_, Jan 25 2025
%t A321503 aQ[n_]:=Module[{v={PrimeNu[n], PrimeNu[n+1]}}, Min[v]>2]; Select[Range[1300], aQ] (* _Amiram Eldar_, Nov 12 2018 *)
%o A321503 (PARI) select( is(n)=omega(n)>2&&omega(n+1)>2, [1..1300])
%Y A321503 Subsequence of A000977.
%Y A321503 Cf. A255346, A321504 .. A321506, A321489 (analog for k = 2, ..., 7 prime divisors).
%Y A321503 Cf. A321493, A321494 .. A321497 (subsequences of the above: m or m+1 has more than k prime divisors).
%Y A321503 Cf. A074851, A140077, A140078, A140079 (complementary subsequences: m and m+1 have exactly k = 2, 3, 4, 5 prime divisors).
%K A321503 nonn
%O A321503 1,1
%A A321503 _M. F. Hasler_, Nov 13 2018