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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A033188 Minimal difference of any increasing arithmetic progression of n primes. 10
 0, 1, 2, 6, 6, 30, 150, 210, 210, 210, 2310, 2310, 30030, 30030, 30030, 30030, 510510, 510510, 9699690, 9699690, 9699690 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS The entries shown have been proved to be correct. LINKS Jens Kruse Andersen, Status of minimal arithmetic progressions of primes Eric Weisstein's World of Mathematics, Prime Arithmetic Progression. FORMULA David W. Wilson conjectures that a(n) = n# (n primorial, A034386) for n >= 8. If this is true then a(22) onwards are: 9699690, 223092870, 223092870, 223092870, 223092870, 223092870, 223092870, 6469693230, 6469693230, ... CROSSREFS Cf. A033189 (initial terms), A113872 (last terms). Cf. A034386, A204189. Sequence in context: A284008 A284576 A060114 * A093364 A113461 A061558 Adjacent sequences: A033185 A033186 A033187 * A033189 A033190 A033191 KEYWORD nonn,hard AUTHOR EXTENSIONS Entry revised Feb 02 2006 by N. J. A. Sloane, based on suggestions from Jens Kruse Andersen. 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.

Last modified December 6 16:00 EST 2022. Contains 358644 sequences. (Running on oeis4.)