login

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”).

A337812
Numbers k such that the number of prime factors, counted with multiplicity, of 2^k - 1 is greater than the corresponding count for 2^k + 1.
3
4, 6, 8, 12, 16, 18, 20, 22, 24, 28, 30, 32, 36, 40, 42, 43, 44, 48, 52, 54, 56, 58, 60, 64, 66, 68, 70, 72, 76, 79, 80, 84, 87, 88, 90, 92, 94, 96, 100, 102, 104, 106, 108, 110, 112, 114, 116, 117, 119, 120, 124, 126, 128, 132, 136, 138, 140, 144, 146, 148, 151
OFFSET
1,1
MATHEMATICA
Select[Range[152], PrimeOmega[2^#-1]>PrimeOmega[2^#+1]&] (* Harvey P. Dale, Dec 31 2022 *)
PROG
(PARI) for(n=1, 160, if(bigomega(2^n-1)>bigomega(2^n+1), print1(n, ", ")))
CROSSREFS
KEYWORD
nonn
AUTHOR
Hugo Pfoertner, Sep 23 2020
STATUS
approved