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 A052299 #21 Aug 24 2024 06:08:01 %S A052299 1,2,1,2,1,2,2,1,3,1,2,3,2,1,2,3,1,2,2,2,1,2,2,2,3,2,2,2,1,1,2,3,2,3, %T A052299 2,2,2,1,2,3,2,2,2,3,2,2,2,3,2,2,3,1,1,2,2,3,2,2,3,1,2,2,3,2,2,2,1,3, %U A052299 2,2,1,2,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,4,2,2,2,2,2,2,2,1,3,1,2,2,2,2,4,2,2 %N A052299 Minimal number of distinct prime factors of any composite number between n-th and (n+1)-st primes. %H A052299 Amiram Eldar, <a href="/A052299/b052299.txt">Table of n, a(n) for n = 2..10000</a> %e A052299 For n = 81: prime(81) = 419, prime(82) = 421. The intermediate range of composites includes only 420 = 4*3*5*7 having 4 distinct prime factors, so a(81) = 4. %t A052299 Min[PrimeNu[Range[#[[1]]+1,#[[2]]-1]]]&/@Partition[Prime[ Range[ 2,110]],2,1] (* _Harvey P. Dale_, Mar 31 2012 *) %Y A052299 Cf. A052180, A052248, A052298. %K A052299 nonn %O A052299 2,2 %A A052299 _Labos Elemer_, Feb 09 2000 %E A052299 Offset corrected by _Sean A. Irvine_, Nov 04 2021