cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A084402 n-th partial product - 1 is a prime, where a(n) > 1.

Original entry on oeis.org

3, 2, 2, 2, 2, 4, 2, 3, 6, 4, 5, 5, 5, 10, 4, 3, 5, 8, 22, 13, 14, 2, 5, 5, 2, 20, 9, 9, 24, 5, 26, 15, 14, 25, 25, 4, 9, 30, 9, 21, 12, 11, 10, 2, 40, 19, 8, 13, 11, 50, 3, 25, 25, 8, 5, 25, 46, 19, 47, 54, 9, 13, 14, 43, 4, 24, 28, 16, 33, 25, 152, 2, 11, 22, 6, 78, 87, 7, 10, 21, 77, 23
Offset: 1

Views

Author

Amarnath Murthy, May 31 2003

Keywords

Comments

a(n) exists for each n by Dirichlet's theorem. - Charles R Greathouse IV, Oct 31 2014
Same as A036013 for n > 4. - Georg Fischer, Oct 19 2018

Examples

			3-1 = 2, 3*2-1 = 5, 3*2*2 -1 = 11, etc. are primes.
		

Crossrefs

Programs

  • PARI
    lista(nn) = {v = vector(nn); for (n=1, nn, v[n] = 2; while (! isprime(prod(i=1, n, v[i])-1), v[n]++); print1(v[n], ", "););} \\ Michel Marcus, Oct 31 2014
    
  • PARI
    first(n) = my(res=vector(n), pp=1, t); for(i = 1, n, t = 2; while(!isprime(pp * t - 1), t++); pp *= t; res[i]=t); res \\ David A. Corneth, Oct 19 2018

Extensions

More terms from David Wasserman, Dec 22 2004