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 A321506 #16 Jul 28 2020 19:32:00 %S A321506 11243154,13516580,16473170,16701684,17348330,19286805,20333495, %T A321506 21271964,21849905,22054515,22527141,22754589,22875489,24031370, %U A321506 25348070,25774329,28098245,28618394,28625960,30259229,31846269,32642805,32734910,33205029,33631520,33641894,35023365 %N A321506 Numbers m such that m and m+1 each have at least 6 distinct prime factors. %C A321506 Equals A273879 up to a(138) = 58524465, which is not in A273879: see A321496 for the complement. %H A321506 M. F. Hasler, <a href="/A321506/b321506.txt">Table of n, a(n) for n = 1..150</a> %t A321506 Select[Range[36000000], PrimeNu[#] > 5 && PrimeNu[# + 1] > 5 &] (* _Amiram Eldar_, Nov 12 2018 *) %t A321506 Position[Partition[PrimeNu[Range[3503*10^4]],2,1],_?(#[[1]]>5&&#[[2]]> 5&), 1,Heads-> False]//Flatten (* _Harvey P. Dale_, Jul 28 2020 *) %o A321506 (PARI) is(n)=omega(n)>=6&&omega(n+1)>=6 %Y A321506 Cf. A273879 (variant with "exactly 6"), A321496 (terms not in A273879). %Y A321506 Cf. A321505 (analog for k=5 prime factors). %K A321506 nonn %O A321506 1,1 %A A321506 _M. F. Hasler_, Nov 12 2018