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.

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.

This page as a plain text file.
%I A337812 #8 Dec 31 2022 14:19:11
%S A337812 4,6,8,12,16,18,20,22,24,28,30,32,36,40,42,43,44,48,52,54,56,58,60,64,
%T A337812 66,68,70,72,76,79,80,84,87,88,90,92,94,96,100,102,104,106,108,110,
%U A337812 112,114,116,117,119,120,124,126,128,132,136,138,140,144,146,148,151
%N 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.
%t A337812 Select[Range[152],PrimeOmega[2^#-1]>PrimeOmega[2^#+1]&] (* _Harvey P. Dale_, Dec 31 2022 *)
%o A337812 (PARI) for(n=1,160,if(bigomega(2^n-1)>bigomega(2^n+1),print1(n,", ")))
%Y A337812 Cf. A046051, A054992, A309942, A337810, A337811, A337813.
%K A337812 nonn
%O A337812 1,1
%A A337812 _Hugo Pfoertner_, Sep 23 2020