Search: id:A000946
Results 1-1 of 1 results found.

%I A000946 M0864 N0330
%S A000946 2,3,7,43,139,50207,340999,2365347734339,4680225641471129,1368845206580129,
%T A000946 889340324577880670089824574922371,20766142440959799312827873190033784610984957267051218394040721,
%U A000946 3486546133523738294549021453705017008734873145092643149204854821614266466998637603378972254923344607825545244\
               648001799
%N A000946 Euclid-Mullin sequence: a(1) = 2, a(n+1) is largest prime factor of Product_{k=1..n} 
               a(k) + 1.
%C A000946 Cox and van der Poorten claim to show that 5, 11, 13, 17, ... are not 
               members of this sequence. - Charles R Greathouse IV, Jul 02 2007
%D A000946 C. D. Cox and A. J. van der Poorten, "On a sequence of prime numbers", 
               Journal of the Australian Mathematical Society 8 (1968), pp. 571-574. 
               [Note that the argument used here is incorrect, as pointed out by 
               Naur.]
%D A000946 R. K. Guy and R. Nowakowski, Discovering primes with Euclid, Delta (Waukesha), 
               Vol. 5, pp. 49-63, 1975.
%D A000946 T. Naur, Mullin's sequence of primes is not monotonic, Proc. Amer. Math. 
               Soc., 90 (1984), 43-44.
%D A000946 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A000946 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A000946 S. S. Wagstaff, Jr., Computing Euclid's primes, Bull. Institute Combin. 
               Applications, 8 (1993), 23-32.
%Y A000946 Cf. A000945, A005265, A005266.
%Y A000946 Sequence in context: A106864 A085682 A083369 this_sequence A091771 A072714 
               A051786
%Y A000946 Adjacent sequences: A000943 A000944 A000945 this_sequence A000947 A000948 
               A000949
%K A000946 nonn,nice
%O A000946 1,1
%A A000946 N. J. A. Sloane (njas(AT)research.att.com).

Search completed in 0.002 seconds