cp's OEIS Frontend

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.

A101936 Numbers n with omega(n) = omega of 3 nearest larger and 3 nearest smaller neighbors.

This page as a plain text file.
%I A101936 #11 May 21 2017 18:28:13
%S A101936 144,145,215,216,326,2305,10283,16685,19055,20215,21198,25782,33335,
%T A101936 35121,35167,35205,39696,39697,40272,41393,41783,42345,42413,44363,
%U A101936 44364,44365,48922,48923,48924,48925,53737,54352,54353,56017,56018
%N A101936 Numbers n with omega(n) = omega of 3 nearest larger and 3 nearest smaller neighbors.
%H A101936 G. C. Greubel, <a href="/A101936/b101936.txt">Table of n, a(n) for n = 1..1000</a>
%e A101936 10283 is in the sequence because 10280, 10281, 10282, 10283, 10284, 10285, 10286 all have the same number of distinct prime factors (3).
%t A101936 For[i=2, i<100000, If[Length[FactorInteger[i-3]] == Length[FactorInteger[i-2]] == Length[FactorInteger[i-1]] == Length[FactorInteger[i]] == Length[FactorInteger[i+1]] == Length[FactorInteger[i+2]] ==Length[FactorInteger[i+3]], Print[i]];i++ ]
%t A101936 Select[Range[1300], PrimeNu[#] == PrimeNu[# - 1] == PrimeNu[# - 2] == PrimeNu[# - 3] == PrimeNu[# + 1] == PrimeNu[# + 2] == PrimeNu[# + 3] &] (* _G. C. Greubel_, May 21 2017 *)
%Y A101936 Cf. A001221, A101932, A101932.
%K A101936 easy,nonn
%O A101936 1,1
%A A101936 _Neil Fernandez_, Dec 21 2004