login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052298 Maximal number of distinct prime factors of any composite number between n-th and (n+1)-st primes. 0
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, 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, 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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
EXAMPLE
n=46, p(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]
MATHEMATICA
Max[PrimeNu[Range[First[#]+1, Last[#]-1]]]&/@Partition[ Prime[ Range[ 2, 110]], 2, 1] (* Harvey P. Dale, Sep 26 2014 *)
CROSSREFS
Sequence in context: A359309 A147793 A352201 * A366441 A179938 A081412
KEYWORD
nonn
AUTHOR
Labos Elemer, Feb 09 2000
EXTENSIONS
Missing a(1)=0 inserted by Sean A. Irvine, Nov 04 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 17 23:23 EDT 2024. Contains 371767 sequences. (Running on oeis4.)