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 A367008 #10 Jan 06 2024 09:21:52
%S A367008 0,1,2,2,2,2,3,3,2,2,4,2,3,3,3,3,2,4,4,4,5,2,4,4,4,4,5,4,3,3,6,6,3,2,
%T A367008 5,2,4,3,4,3,3,4,4,5,4,4,5,5,4,5,6,3,6,3,5,4,4,5,5,4,4,7,3,3,7,5,9,5,
%U A367008 4,5,5,6,5,5,5,5,5,4,4,6,4,4,4,5,4,7,6
%N A367008 Number of prime factors of n*2^n + 1, counted with multiplicity.
%C A367008 The numbers n*2^n+1 are called Cullen numbers.
%H A367008 Amiram Eldar, <a href="/A367008/b367008.txt">Table of n, a(n) for n = 0..865</a>
%F A367008 a(n) = bigomega(n*2^n + 1) = A001222(A002064(n)).
%t A367008 Table[PrimeOmega[n*2^n + 1], {n, 0, 100}] (* _Amiram Eldar_, Jan 06 2024 *)
%o A367008 (PARI) a(n) = bigomega(n*2^n + 1); \\ _Amiram Eldar_, Jan 06 2024
%Y A367008 Cf. A002064, A001222, A366899, A367007.
%K A367008 nonn
%O A367008 0,3
%A A367008 _Sean A. Irvine_, Oct 31 2023