login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
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
Sequence in context: A325601 A310662 A231569 * A100390 A199768 A157932
KEYWORD
nonn
AUTHOR
Hugo Pfoertner, Sep 23 2020
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 03:08 EDT 2024. Contains 371918 sequences. (Running on oeis4.)