This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A167518 #8 Jul 14 2012 11:32:32 %S A167518 2,151157,353359367,139149151157,101103107109113, %T A167518 704517045770459704817048770489,97101103107109113127, %U A167518 1519315199152171522715233152411525915263,382138233833384738513853386338773881,9319932393379341934393499371937793919397 %N A167518 Least reversible prime (A007500) which is a concatenation of n consecutive primes. %C A167518 Here the weaker definition of A007500 is used, but all terms > 2 known so far are also Emirps in the sense of A006567 (i.e. different from their reversal), so it is sufficient to change the first term to 13 in order to have a sequence of "true" emirps. %C A167518 Is it possible to prove that all terms > 2 are in A006567? %o A167518 (PARI) for(k=1,19,for(i=0,1e9, isprime( eval( p=concat( vector( k,j,Str( prime( i+j )))))) & isprime(eval(concat(vecextract(Vec(p),"-1..1")))) & break); print1(p,", ")) %Y A167518 Cf. A030997, A167517. %K A167518 nonn,base %O A167518 1,1 %A A167518 _M. F. Hasler_, Nov 10 2009 %E A167518 Edited by _Charles R Greathouse IV_, Apr 28 2010 %E A167518 a(9)-a(10) from _Donovan Johnson_, Sep 25 2011