|
|
A155900
|
|
Numbers k such that Omega(k) = Omega(2^k-1), where Omega(k) is the number of prime factors of k counted with multiplicity (A001222).
|
|
1
|
|
|
1, 2, 3, 4, 5, 7, 8, 9, 13, 16, 17, 19, 27, 31, 32, 49, 61, 89, 107, 127, 521, 607, 1279, 2203, 2281, 3217
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Mersenne prime exponents A000043 are a subsequence, with Omega(p)=Omega(2^p-1)=1.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
Select[Range[200], PrimeOmega[#]==PrimeOmega[2^#-1]&] (* Harvey P. Dale, Apr 21 2012 *)
|
|
PROG
|
(PARI) for( i=1, 999, bigomega(2^i-1)==bigomega(i) & print1(i", "))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|