|
Search: id:A000946
|
|
|
| A000946 |
|
Euclid-Mullin sequence: a(1) = 2, a(n+1) is largest prime factor of Product_{k=1..n} a(k) + 1.
(Formerly M0864 N0330)
|
|
+0
40
|
|
| 2, 3, 7, 43, 139, 50207, 340999, 2365347734339, 4680225641471129, 1368845206580129, 889340324577880670089824574922371, 20766142440959799312827873190033784610984957267051218394040721, 3486546133523738294549021453705017008734873145092643149204854821614266466998637603378972254923344607825545244648001799
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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
|
|
REFERENCES
|
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.]
R. K. Guy and R. Nowakowski, Discovering primes with Euclid, Delta (Waukesha), Vol. 5, pp. 49-63, 1975.
T. Naur, Mullin's sequence of primes is not monotonic, Proc. Amer. Math. Soc., 90 (1984), 43-44.
S. S. Wagstaff, Jr., Computing Euclid's primes, Bull. Institute Combin. Applications, 8 (1993), 23-32.
|
|
CROSSREFS
|
Cf. A000945, A005265, A005266.
Sequence in context: A106864 A085682 A083369 this_sequence A091771 A072714 A051786
Adjacent sequences: A000943 A000944 A000945 this_sequence A000947 A000948 A000949
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
