This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A034881 a(1) = 1; for n>1, a(n) = smallest integer > a(n-1) such that a(n)*a(i)+1 is prime for all 1 <= i <= n-1. 5
 1, 2, 6, 18, 30, 270, 606, 123120, 888456, 23070450, 238550160, 8282903640, 72789145650, 15681266370000, 18216437241240 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(16) > 2*10^16. a(n) exists for every n if Dickson's conjecture is true. - Charles R Greathouse IV, Nov 30 2012 LINKS Bill Taylor et al., Sets producing primes, sci.math (2003) EXAMPLE After a(1)=1, a(2)=2, a(3)=6, we want m, the smallest number >6 such that m+1, 2m+1 and 6m+1 are all prime: this is m = 18 = a(4). MATHEMATICA f[s_List] := Block[{k = s[[-1]] + 1, m = s}, While[ Union@ PrimeQ[k*m + 1] != {True}, k++]; Append[s, k]]; Nest[f, {1}, 10] (* Robert G. Wilson v, Dec 02 2012 *) CROSSREFS Cf. A219761, A093483. Sequence in context: A288815 A277200 A277324 * A146345 A064842 A302647 Adjacent sequences:  A034878 A034879 A034880 * A034882 A034883 A034884 KEYWORD nonn AUTHOR EXTENSIONS a(9)-a(13) found by Phil Carmody. a(14)-a(15) from Don Reble, Oct 15 2012 Edited by N. J. A. Sloane, Dec 01 2012 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 August 19 18:51 EDT 2019. Contains 326133 sequences. (Running on oeis4.)