The On-Line Encyclopedia of Integer Sequences (OEIS)

The OEIS is supported by the many generous donors to the OEIS Foundation.

Revision History for A000945

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A000945

Euclid-Mullin sequence: a(1) = 2, a(n+1) is smallest prime factor of 1 + Product_{k=1..n} a(k).
(history; published version)

#175 by Andrew Howroyd at Thu Aug 15 19:05:44 EDT 2024

STATUS

reviewed

approved

#174 by Stefano Spezia at Thu Aug 15 16:16:31 EDT 2024

STATUS

proposed

reviewed

#173 by Stefano Spezia at Thu Aug 15 16:16:24 EDT 2024

STATUS

editing

proposed

#172 by Stefano Spezia at Thu Aug 15 16:16:20 EDT 2024

LINKS

Daphne Stouthart, <a href="https://studenttheses.uu.nl/handle/20.500.12932/47109">Euclid and the infinite number of missing primes</a>, Bachelor Thesis, Utrecht Univ (Netherlands, 2024). See p. 41.

STATUS

proposed

editing

#171 by Michael De Vlieger at Thu Aug 15 11:15:00 EDT 2024

STATUS

editing

proposed

#170 by Michael De Vlieger at Thu Aug 15 11:14:58 EDT 2024

LINKS

Daphne Stouthart, <a href="https://studenttheses.uu.nl/handle/20.500.12932/47109">Euclid and the infinite number of missing primes</a>, Bachelor Thesis, Utrecht Univ (Netherlands, 2024). See p. 4.

STATUS

approved

editing

#169 by N. J. A. Sloane at Thu Apr 04 10:35:05 EDT 2024

STATUS

proposed

approved

#168 by Jeppe Stig Nielsen at Mon Apr 01 17:49:16 EDT 2024

STATUS

editing

proposed

#167 by Jeppe Stig Nielsen at Mon Apr 01 17:45:26 EDT 2024

PROG

(PARI) P=[]; until(, print(P=concat(P, factor(vecprod(P)+1)[1, 1]))) \\ Jeppe Stig Nielsen, Apr 01 2024

STATUS

approved

editing

#166 by Alois P. Heinz at Fri Oct 27 18:20:27 EDT 2023

STATUS

reviewed

approved