Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Apr 15 2023 23:31:57
%S 2,3,4,6,7,8,10,12,14,15,16,18,20,21,22,24,26,28,30,31,33,34,35,36,38,
%T 39,40,42,44,45,46,48,50,51,52,54,55,56,57,58,60,62,63,65,66,68,69,70,
%U 72,74,75,76,77,78,80,82,84,85,86,87,88,90,91,92,93,94,95,96,98,99,100
%N Numbers k such that omega(k+1) < 2*omega(k), where omega(k) is the number of distinct prime divisors of k.
%C A001221(a(n)+1) < 2*A001221(a(n)).
%H Reinhard Zumkeller, <a href="/A062974/b062974.txt">Table of n, a(n) for n = 1..10000</a>
%o (PARI) j=[]; for(n=1,200, if(omega(n+1)<2*omega(n),j=concat(j,n))); j
%o (Haskell)
%o import Data.List (findIndices)
%o a062974 n = a062974_list !! (n-1)
%o a062974_list = map (+ 1) $ findIndices (< 0) $
%o zipWith (-) (tail a001221_list) $ map (* 2) a001221_list
%o -- _Reinhard Zumkeller_, Jan 22 2013
%Y Cf. A006049 (subsequence).
%K nonn
%O 1,1
%A _Jason Earls_, Jul 26 2001