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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A173750 a(n) = smallest positive m such that k*m+1 is prime for k=2..n. 0
 1, 1, 2, 330, 714, 13530, 192660, 512820, 4601310, 863815050, 262428279750, 2169289182060, 2169289182060, 2169289182060, 4646092391146085880 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS MATHEMATICA a[n_] := Block[{k = If[n < 4, 1, 6], s}, s = k; While[! AllTrue[k Range[2, n] + 1, PrimeQ], k += s]; k]; Array[a, 9] (* Giovanni Resta, Mar 30 2017 *) PROG (Magma) S:=[]; m:=1; for n in [1..11] do while not forall(t){ k: k in [2..n] | IsPrime(k*m+1) } do m+:=1; end while; Append(~S, m); end for; S; // Klaus Brockhaus, Nov 26 2010 CROSSREFS Cf. A088250 (smallest number k such that r*k+1 is prime for all r = 1 to n). Sequence in context: A012601 A012606 A012729 * A088250 A142355 A203608 Adjacent sequences: A173747 A173748 A173749 * A173751 A173752 A173753 KEYWORD nonn,more AUTHOR Zak Seidov, Nov 26 2010 EXTENSIONS a(12)-a(15) from Giovanni Resta, Mar 31 2017 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 January 29 08:01 EST 2023. Contains 359915 sequences. (Running on oeis4.)