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 A321505 #14 Nov 14 2018 13:43:24 %S A321505 254540,310155,378014,421134,432795,483405,486590,486794,488565, %T A321505 489345,507129,522444,545258,549185,558789,558830,567644,577940, %U A321505 584154,591260,598689,627095,634809,637329,663585,666995,667029,678755,687939,690234,707420,712425,720005,720290,728364,743589 %N A321505 Numbers k such that k and k+1 each have at least 5 distinct prime factors. %C A321505 Equals A140079 up to a(34) but a(35) = 728364 is not in A140079, see A321495. %H A321505 M. F. Hasler, <a href="/A321505/b321505.txt">Table of n, a(n) for n = 1..10000</a> %t A321505 Select[Range[750000], PrimeNu[#] > 4 && PrimeNu[# + 1] > 4 &] (* _Amiram Eldar_, Nov 12 2018 *) %o A321505 (PARI) is(n)=omega(n)>=5&&omega(n+1)>=5 %Y A321505 Cf. A140079 (variant with "exactly 5"), A321495 (terms not in A140079). %Y A321505 Cf. A321504 (analog for k=4 prime factors), A321506 (analog for k=6). %K A321505 nonn %O A321505 1,1 %A A321505 _M. F. Hasler_, Nov 12 2018