Definition:Euclid Prime/Sequence

From ProofWiki
Jump to navigation Jump to search

Definition

The sequence of Euclid primes begins:

$2, 3, 7, 31, 211, 2311, 200 \, 560 \, 490 \, 131, \ldots$

This sequence is A018239 in the On-Line Encyclopedia of Integer Sequences (N. J. A. Sloane (Ed.), 2008).


This sequence can be better comprehended as:

$\sequence {p_n \# + 1}$

where:

$p_n \#$ denotes the primorial of the $n$th prime number
$n$ is the sequence:
$0, 1, 2, 3, 4, 5, 11, 75, 171, 172, 384, 457, 616, 643, \ldots$

This sequence is A014545 in the On-Line Encyclopedia of Integer Sequences (N. J. A. Sloane (Ed.), 2008).


Source of Name

This entry was named for Euclid.


Also see