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

A366899
Number of prime factors of n*2^n - 1, counted with multiplicity.
6
0, 1, 1, 3, 2, 1, 2, 2, 2, 2, 3, 2, 4, 5, 4, 6, 3, 2, 3, 2, 4, 5, 3, 3, 2, 3, 3, 4, 5, 1, 3, 2, 3, 5, 3, 5, 2, 3, 2, 5, 4, 3, 5, 3, 4, 5, 7, 4, 4, 3, 3, 4, 5, 3, 4, 3, 4, 3, 5, 3, 3, 4, 3, 9, 6, 4, 4, 6, 4, 3, 3, 2, 5, 4, 1, 9, 3, 4, 5, 2, 1, 4, 5, 6, 2, 3, 4
OFFSET
1,4
COMMENTS
The numbers n*2^n-1 are called Woodall (or Riesel) numbers.
LINKS
FORMULA
a(n) = bigomega(n*2^n - 1) = A001222(A003261(n)).
MATHEMATICA
Table[PrimeOmega[n*2^n - 1], {n, 1, 100}] (* Amiram Eldar, Dec 09 2023 *)
PROG
(PARI) a(n) = bigomega(n*2^n - 1); \\ Michel Marcus, Dec 09 2023
CROSSREFS
Cf. A001222, A003261, A085723, A366898 (divisors), A367006 (without multiplicity).
Sequence in context: A079099 A213195 A256794 * A068929 A060567 A174543
KEYWORD
nonn
AUTHOR
Tyler Busby, Oct 26 2023
STATUS
approved