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.
%I A366899 #22 Dec 11 2023 08:37:10
%S A366899 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,
%T A366899 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,
%U A366899 4,3,3,2,5,4,1,9,3,4,5,2,1,4,5,6,2,3,4
%N A366899 Number of prime factors of n*2^n - 1, counted with multiplicity.
%C A366899 The numbers n*2^n-1 are called Woodall (or Riesel) numbers.
%H A366899 Amiram Eldar, <a href="/A366899/b366899.txt">Table of n, a(n) for n = 1..865</a>
%F A366899 a(n) = bigomega(n*2^n - 1) = A001222(A003261(n)).
%t A366899 Table[PrimeOmega[n*2^n - 1], {n, 1, 100}] (* _Amiram Eldar_, Dec 09 2023 *)
%o A366899 (PARI) a(n) = bigomega(n*2^n - 1); \\ _Michel Marcus_, Dec 09 2023
%Y A366899 Cf. A001222, A003261, A085723, A366898 (divisors), A367006 (without multiplicity).
%K A366899 nonn
%O A366899 1,4
%A A366899 _Tyler Busby_, Oct 26 2023