%I A064820
%S A064820 1874131,7379971,200535078449,614889782525749169,7858321551080266924799489,
%T A064820 267064515689275851355623723492869,23984823528925228172706521638691738510609,
%U A064820 4014476939333036189094441199026045136644989502689,1492182350939279320058875736615841068547583863325477042409
%V A064820 -1874131,-7379971,200535078449,614889782525749169,7858321551080266924799489,
%W A064820 267064515689275851355623723492869,23984823528925228172706521638691738510609,
%X A064820 4014476939333036189094441199026045136644989502689,1492182350939279320058875736615841068547583863325477042409
%N A064820 Product_{k=1..4*n-9} p(k) - p(4n)^4 where p(i) = i-th prime.
%C A064820 It is known that a(n) > 0 for n >= 5.
%D A064820 S. E. Mamangakis, Synthetic proofs of some prime number inequalities, 
               Duke Math. J., 29 (1962), 471-473.
%H A064820 Harry J. Smith, <a href="b064820.txt">Table of n, a(n) for n=3,...,50</
               a>
%o A064820 (PARI) { for (n=3, 50, p=prod(k=1, 4*n-9, prime(k)); write("b064820.txt", 
               n, " ", p - prime(4*n)^4) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), 
               Sep 27 2009]
%Y A064820 Sequence in context: A115495 A015347 A145276 this_sequence A032595 A032596 
               A032597
%Y A064820 Adjacent sequences: A064817 A064818 A064819 this_sequence A064821 A064822 
               A064823
%K A064820 sign
%O A064820 3,1
%A A064820 N. J. A. Sloane (njas(AT)research.att.com), Oct 23 2001