cp's OEIS Frontend

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.

Showing 1-1 of 1 results.

A052299 Minimal number of distinct prime factors of any composite number between n-th and (n+1)-st primes.

Original entry on oeis.org

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, 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, 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
Offset: 2

Views

Author

Labos Elemer, Feb 09 2000

Keywords

Examples

			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.
		

Crossrefs

Programs

  • Mathematica
    Min[PrimeNu[Range[#[[1]]+1,#[[2]]-1]]]&/@Partition[Prime[ Range[ 2,110]],2,1] (* Harvey P. Dale, Mar 31 2012 *)

Extensions

Offset corrected by Sean A. Irvine, Nov 04 2021
Showing 1-1 of 1 results.