The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A084403 Primes arising in A084402. a(n) = n-th partial product of A084402 - 1. 0
 2, 5, 11, 23, 47, 191, 383, 1151, 6911, 27647, 138239, 691199, 3455999, 34559999, 138239999, 414719999, 2073599999, 16588799999, 364953599999, 4744396799999, 66421555199999, 132843110399999, 664215551999999, 3321077759999999 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS This is a sequence similar to A090552 but here with primes: a(1) = 2; for n>=2, a(n) is the smallest prime p for which p+1 is a multiple of a(n-1) + 1. - J. M. Bergot, Oct 16 2014, revised by Wolfdieter Lang, Nov 24 2014 LINKS EXAMPLE 3-1=2, 3*2-1=5, 3*2*2-1=11, etc. are the primes arising in A084402. PROG (PARI) lista(nn) = {v = vector(nn); for (n=1, nn, v[n] = 2; while (! isprime(p=prod(i=1, n, v[i])-1), v[n]++); print1(p, ", "); ); } \\ Michel Marcus, Oct 31 2014 CROSSREFS Cf. A084402. Sequence in context: A334276 A055496 A105120 * A261201 A055011 A007505 Adjacent sequences:  A084400 A084401 A084402 * A084404 A084405 A084406 KEYWORD nonn AUTHOR Amarnath Murthy, May 31 2003 EXTENSIONS More terms from David Wasserman, Dec 22 2004 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 December 9 09:37 EST 2021. Contains 349627 sequences. (Running on oeis4.)