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 #43 Aug 02 2015 17:37:26
%S 24,48,64,72,80,96,112,128,144,160,192,224,240,288,320,336,352,384,
%T 416,448,480,576,672,800,864,960,1056,1440
%N Numbers n such that d(m) - f(m) >= n/2^f(m), where m = 2^n - 1, d(m) is the number of distinct prime factors of m, and f(m) is the number of Fermat primes less than or equal to 65537 that divide m.
%C For every n there exists a Sierpiński/Riesel number with modulus a(n).
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Covering_set">Covering set</a>
%o (PARI) lista(nn) = {vfp = [3, 5, 17, 257, 65537]; for(n = 1, nn, m = 2^n-1; dm = omega(m); fm = sum(k=1, #vfp, (m % vfp[k]) == 0); if (dm - fm >= n/2^fm, print1(n, ", ")););} \\ _Michel Marcus_, Jul 20 2015
%Y Cf. A019434, A046800.
%K nonn,more
%O 1,1
%A _Arkadiusz Wesolowski_, Jul 16 2015