The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A099191 Smallest prime p such that p+n is twice its reversal, or 0 if impossible. 0
73, 2, 3, 0, 5, 0, 7, 0, 0, 0, 11, 0, 211, 0, 0, 0, 53, 0, 613, 0, 0, 0, 0, 0, 43, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 23, 0, 241, 0, 0, 0, 0, 0, 13, 0, 0, 0, 251, 0, 0, 0, 0, 0, 653, 0, 97, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 271, 0, 0, 0, 0, 0, 673, 0, 0, 0, 281, 0, 67, 0, 0, 0, 683, 0, 0, 0, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
a(13) = 211 since 211+13 = 224 = 2*112. a(25) = 43 since 25+43 = 68 = 2*34.
MATHEMATICA
f[n_] := Block[{k = 1}, While[p = Prime[k]; p + n != 2FromDigits[ Reverse[ IntegerDigits[ p]]] && k < 10^6, k++ ]; If[k == 10^6, 0, Prime[k]]]; Table[ f[n], {n, 75}]
CROSSREFS
Cf. A099190.
Sequence in context: A159440 A308586 A113889 * A051325 A249276 A102050
KEYWORD
base,nonn
AUTHOR
Robert G. Wilson v, Oct 01 2004
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 9 19:57 EDT 2024. Contains 373248 sequences. (Running on oeis4.)