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 A052298 #21 Aug 24 2024 06:08:25
%S A052298 0,1,2,2,2,2,2,2,2,3,2,2,3,2,2,2,3,3,3,2,3,2,3,3,2,3,3,2,3,3,3,3,3,3,
%T A052298 3,3,2,3,3,3,3,3,2,3,3,4,3,2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,4,3,3,
%U A052298 3,3,3,3,3,3,3,3,4,3,3,3,4,3,2,3,3,3,3,3,4,3,3,3,3,3,2,3,4,3,3,4,3,3,3,4,3,3
%N A052298 Maximal number of distinct prime factors of any composite number between n-th and (n+1)-st primes.
%H A052298 Amiram Eldar, <a href="/A052298/b052298.txt">Table of n, a(n) for n = 1..10000</a>
%e A052298 For n = 46, prime(46) = 199, next prime is 211. In between, the number of prime factors for {200,201,...,210} is {2,2,2,2,3,2,2,2,2,2,4} of which the maximum is 4, which arises at 210. So a(46) = 4. [Corrected by _Sean A. Irvine_, Nov 04 2021]
%t A052298 Join[{0}, Max[PrimeNu[Range[First[#]+1, Last[#]-1]]]&/@Partition[ Prime[ Range[ 2, 110]], 2, 1]] (* _Harvey P. Dale_, Sep 26 2014 *)
%Y A052298 Cf. A052180, A052248, A052299.
%K A052298 nonn
%O A052298 1,3
%A A052298 _Labos Elemer_, Feb 09 2000
%E A052298 Missing a(1)=0 inserted by _Sean A. Irvine_, Nov 04 2021