|
|
A014683
|
|
In the sequence of positive integers add 1 to each prime number.
|
|
9
|
|
|
1, 3, 4, 4, 6, 6, 8, 8, 9, 10, 12, 12, 14, 14, 15, 16, 18, 18, 20, 20, 21, 22, 24, 24, 25, 26, 27, 28, 30, 30, 32, 32, 33, 34, 35, 36, 38, 38, 39, 40, 42, 42, 44, 44, 45, 46, 48, 48, 49, 50, 51, 52, 54, 54, 55, 56, 57, 58, 60, 60, 62, 62, 63, 64, 65, 66, 68, 68, 69, 70, 72, 72
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
For n >= 3, a(n) = smallest composite number m such that m - (n-2) is a prime. - Amarnath Murthy and Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Mar 08 2003.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI) a(n)=n+isprime(n)
(Haskell)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|