This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A101779 a(n) = least k such that all of k, 2k+1, 3k+2, ..., nk+n-1 are primes, or 0 if no such k is found. 1
 2, 2, 3, 5, 5, 154769, 2894219, 2894219, 407874179, 214580145779, 9448481062019, 247236503934419, 2545206711847799, 18178612369988250179, 53792264108455702829 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(10) > 3691000000, Robert G. Wilson v, Mar 23 2007 By definition the same as A088651(n)-1 if k exists. It is conjectured k always exists. - a(10)-a(15) from Jens Kruse Andersen, May 02 2008 LINKS MATHEMATICA f[1] = 2; f[n_] := f[n] = Block[{k = PrimePi@ f[n - 1], p, t = Table[i*p + (i - 1), {i, 2, n}]}, While[p = Prime@k; Union@PrimeQ@t != {True}, k++ ]; p]; Do[ Print[f@n // Timing], {n, 10}] (* Robert G. Wilson v, Mar 23 2007 *) CROSSREFS Cf. A000040, A005384, A067256, A067257, A067258, A101767, A101768, A101769, A101770. Cf. A088651. Sequence in context: A060048 A110699 A035537 * A169891 A137756 A225489 Adjacent sequences:  A101776 A101777 A101778 * A101780 A101781 A101782 KEYWORD nonn AUTHOR Jonathan Vos Post and Ray Chandler, Jan 13 2005 EXTENSIONS a(10)-a(15) from Jens Kruse Andersen, May 02 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .