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 A101940 #9 May 21 2017 18:29:37 %S A101940 37,53,89,97,113,121,157,163,173,211,223,233,251,263,277,289,293,307, %T A101940 317,331,337,343,353,367,373,379,383,389,397,401,409,439,443,449,457, %U A101940 467,479,487,491,499,503,529,541,547,557,563,577,587 %N A101940 Numbers n with omega(n) < omega of 3 nearest larger and 3 nearest smaller neighbors. %H A101940 G. C. Greubel, <a href="/A101940/b101940.txt">Table of n, a(n) for n = 1..10000</a> %e A101940 37 is in the sequence because it has one unique prime factor (itself), whereas 34, 35, 36, 38, 39 and 40 each have more. %t A101940 For[i=1, i<1000, If[And[Length[FactorInteger[i-3]] > Length[FactorInteger[i]], Length[FactorInteger[i-2]]>Length[FactorInteger[i]], Length[FactorInteger[i-1]]>Length[FactorInteger[i]], Length[FactorInteger[i+1]]> Length[FactorInteger[i]], Length[FactorInteger[i+2]]> Length[FactorInteger[i]],Length[FactorInteger[i+3]]> Length[FactorInteger[i]]], Print[i]];i++ ] %t A101940 Select[Range[6500], PrimeNu[#] < Min[PrimeNu[# - 1], PrimeNu[# - 2], PrimeNu[# - 3], PrimeNu[# + 1], PrimeNu[# + 2], PrimeNu[# + 3]] &] (* _G. C. Greubel_, May 21 2017 *) %Y A101940 Cf. A001221, A101934, A101938. %K A101940 easy,nonn %O A101940 1,1 %A A101940 _Neil Fernandez_, Dec 21 2004