The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A075580 Smallest prime p(k) such that the number of distinct prime divisors of all composite numbers between p(k) and p(k+1) is n. 11
 2, 3, 5, 7, 13, 19, 31, 53, 73, 89, 359, 139, 401, 181, 113, 211, 293, 661, 863, 773, 523, 1933, 1831, 1069, 1381, 887, 1637, 1129, 1669, 1951, 4027, 3469, 4177, 6397, 2477, 2971, 5531, 1327, 4297, 4831, 5351, 5591, 9973, 11743, 13187, 8467, 27851, 18803 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS a(10) > a(11). LINKS T. D. Noe and Donovan Johnson, Table of n, a(n) for n = 0..257 (first 200 terms from T. D. Noe) XIAO Gang, Factoris, factors huge integers MATHEMATICA Table[i=1; While[Length[Union[Flatten[Table[First/@FactorInteger[j], {j, (x=Prime[i])+1, NextPrime[x]-1}]]]]!=n, i++]; x, {n, 0, 47}] (* Jayanta Basu, May 25 2013 *) CROSSREFS Cf. A052297, A075581, A059960, A075583, A075584, A075585, A075586, A075587, A075588, A075589. Sequence in context: A101045 A114847 A171969 * A077132 A138184 A236340 Adjacent sequences:  A075577 A075578 A075579 * A075581 A075582 A075583 KEYWORD nonn AUTHOR Amarnath Murthy, Sep 26 2002 EXTENSIONS Corrected and extended by Sam Alexander, Oct 20 2003 STATUS approved

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

Last modified October 31 15:39 EDT 2020. Contains 338110 sequences. (Running on oeis4.)