This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A060882 a(n) = n-th primorial (A002110) minus next prime. 4
 -1, -1, 1, 23, 199, 2297, 30013, 510491, 9699667, 223092841, 6469693199, 200560490093, 7420738134769, 304250263527167, 13082761331669983, 614889782588491357, 32589158477190044671, 1922760350154212639009 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS It is well-known and easy to prove (see Honsbeger) that a(n) > 0 for n > 1. - N. J. A. Sloane, Jul 05 2009 Terms are pairwise coprime with very high probability. I didn't find terms which are pairwise noncoprime, although it may be a case of the "strong law of small numbers." - Daniel Forgues, Apr 23 2012 REFERENCES R. Honsberger, Mathematical Diamonds, MAA, 2003, see p. 79. [Added by N. J. A. Sloane, Jul 05 2009] LINKS Harry J. Smith, Table of n, a(n) for n = 0..100 Hisanori Mishima, P1 * Pn + NextPrime (n = 1 to 100) Hisanori Mishima, P1 * Pn - NextPrime (n = 1 to 100) Hisanori Mishima, P1 * Pn + 1 (n = 1 to 100) Hisanori Mishima, P1 * Pn - 1 (n = 1 to 100) Hisanori Mishima, WIFC (World Integer Factorization Center) MAPLE pp:=n->mul(ithprime(i), i=1..n); [seq(pp(n)-ithprime(n+1), n=1..20)]; MATHEMATICA Join[{-1}, With[{nn=20}, #[[1]]-#[[2]]&/@Thread[{FoldList[Times, 1, Prime[ Range[nn]]], Prime[Range[nn+1]]}]]] (* Harvey P. Dale, May 10 2013 *) PROG (PARI) { n=-1; m=1; forprime (p=2, prime(101), write("b060882.txt", n++, " ", m - p); m*=p; ) } \\ Harry J. Smith, Jul 13 2009 CROSSREFS Cf. A002110, A060881, A064819, A006862, A057588. Sequence in context: A058193 A065314 A065316 * A221670 A128334 A107956 Adjacent sequences:  A060879 A060880 A060881 * A060883 A060884 A060885 KEYWORD sign AUTHOR N. J. A. Sloane, May 05 2001 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 July 16 23:49 EDT 2019. Contains 325092 sequences. (Running on oeis4.)