|
Search: id:A102723
|
|
|
| A102723 |
|
Smallest prime a(n) such that a(n)-x and a(n)+x, for x=1 to n, are all composite. |
|
+0
2
|
|
| 5, 23, 23, 53, 53, 211, 211, 211, 211, 211, 211, 1847, 1847, 2179, 2179, 2179, 2179, 3967, 3967, 16033, 16033, 16033, 16033, 24281, 24281, 24281, 24281, 24281, 24281, 38501, 38501, 38501, 38501, 38501, 38501, 38501, 38501, 38501, 38501, 58831
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(2n+1)=a(2n). - Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 22 2005
|
|
MATHEMATICA
|
f[n_] := Block[{k = 1}, While[ Union[ PrimeQ /@ Sort[ Flatten[ Table[{Prime[k] - i, Prime[k] + i}, {i, n}]]]] != {False}, k++ ]; Prime[k]]; Table[ f[n], {n, 40}] (from Robert G. Wilson v Feb 22 2005)
|
|
CROSSREFS
|
Cf. A023186.
Sequence in context: A078190 A081319 A002582 this_sequence A136146 A018527 A084411
Adjacent sequences: A102720 A102721 A102722 this_sequence A102724 A102725 A102726
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Ray G. Opao (1260(AT)email.com), Feb 06 2005
|
|
EXTENSIONS
|
a(12)-a(40) from Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 22 2005
|
|
|
Search completed in 0.002 seconds
|
