%I A060882
%S A060882 1,1,1,23,199,2297,30013,510491,9699667,223092841,6469693199,
%T A060882 200560490093,7420738134769,304250263527167,13082761331669983,
%U A060882 614889782588491357,32589158477190044671,1922760350154212639009
%V A060882 -1,-1,1,23,199,2297,30013,510491,9699667,223092841,6469693199,
%W A060882 200560490093,7420738134769,304250263527167,13082761331669983,
%X A060882 614889782588491357,32589158477190044671,1922760350154212639009
%N A060882 n-th primorial (A002110) - next prime.
%C A060882 It is well-known and easy to prove (see Honsbeger) that a(n) > 0 for 
               n > 1, [N. J. A. Sloane, Jul 05 2009]
%D A060882 R. Honsberger, Mathematical Diamonds, MAA, 2003, see p. 79. [Added by 
               N. J. A. Sloane, Jul 05 2009]
%H A060882 Harry J. Smith, <a href="b060882.txt">Table of n, a(n) for n=0,...,100</
               a>
%H A060882 Hisanori Mishima, <a href="http://www.asahi-net.or.jp/~KC2H-MSM/mathland/
               matha1/matha103.htm">Factorizations of many number sequences</a>
%H A060882 Hisanori Mishima, <a href="http://www.asahi-net.or.jp/~KC2H-MSM/mathland/
               matha1/matha107.htm">Factorizations of many number sequences</a>
%p A060882 pp:=n->mul(ithprime(i),i=1..n);
%p A060882 [seq(pp(n)-ithprime(n+1),n=1..20)];
%o A060882 (PARI) { n=-1; m=1; forprime (p=2, prime(101), write("b060882.txt", n++, 
               " ", m - p); m*=p; ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), 
               Jul 13 2009]
%Y A060882 Cf. A002110, A060881, A064819.
%Y A060882 Sequence in context: A058193 A065314 A065316 this_sequence A128334 A107956 
               A022683
%Y A060882 Adjacent sequences: A060879 A060880 A060881 this_sequence A060883 A060884 
               A060885
%K A060882 sign
%O A060882 0,4
%A A060882 N. J. A. Sloane (njas(AT)research.att.com), May 05 2001