|
|
A007918
|
|
Least prime >= n (version 1 of the "next prime" function).
|
|
104
|
|
|
2, 2, 2, 3, 5, 5, 7, 7, 11, 11, 11, 11, 13, 13, 17, 17, 17, 17, 19, 19, 23, 23, 23, 23, 29, 29, 29, 29, 29, 29, 31, 31, 37, 37, 37, 37, 37, 37, 41, 41, 41, 41, 43, 43, 47, 47, 47, 47, 53, 53, 53, 53, 53, 53, 59, 59, 59, 59, 59, 59, 61, 61, 67, 67, 67, 67, 67, 67, 71, 71, 71, 71, 73, 73
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
Version 2 of the "next prime" function is "smallest prime > n". This produces A151800.
Maple uses version 2.
According to the "k-tuple" conjecture, a(n) is the initial term of the lexicographically earliest increasing arithmetic progression of n primes; the corresponding common differences are given by A061558. - David W. Wilson, Sep 22 2007
It is easy to show that the initial term of an increasing arithmetic progression of n primes cannot be smaller than a(n). - N. J. A. Sloane, Oct 18 2007
Also, smallest prime bounded by n and 2n inclusively (in accordance with Bertrand's theorem). Smallest prime >n is a(n+1) and is equivalent to smallest prime between n and 2n exclusively. - Lekraj Beedassy, Jan 01 2007
Conjecture: if n > 1, then a(n) < n^(n^(1/n)). - Thomas Ordowski, Feb 23 2023
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI) for(x=0, 100, print1(nextprime(x)", ")) \\ Cino Hilliard, Jan 15 2007
(Haskell)
a007918 n = a007918_list !! n
a007918_list = 2 : 2 : 2 : concat (zipWith
(\p q -> (replicate (fromInteger(q - p)) q))
a000040_list $ tail a000040_list)
(Python)
from sympy import nextprime
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
R. Muller and Charles T. Le (charlestle(AT)yahoo.com)
|
|
STATUS
|
approved
|
|
|
|