OFFSET
1,1
COMMENTS
a(n) == 5 (mod 6) for n >= 2.
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
a(3) = 263 is in the sequence because 263, 264263 and 264264263 are all prime.
MAPLE
filter:= proc(n) local v, w, q;
if not isprime(n) then return false fi;
v:= 10^(1+ilog10(n));
q:= v*(n+1)+n;
if not isprime(q) then return false fi;
isprime((10^(1+ilog10(q))+v)*(n+1)+n)
end proc:
select(filter, [3, seq(i, i=5..100000, 6)]);
MATHEMATICA
pcQ[n_]:=Module[{idn=IntegerDigits[n], idn2=IntegerDigits[n+1]}, AllTrue[ {FromDigits[ Join[ idn2, idn]], FromDigits[ Join[idn2, idn2, idn]]}, PrimeQ]]; Select[Prime[Range[2500]], pcQ] (* The program uses the AllTrue function from Mathematica version 10 *) (* Harvey P. Dale, Sep 11 2019 *)
PROG
(Magma) [p:p in PrimesUpTo(23000)|IsPrime(Seqint(Intseq(p) cat Intseq(p+1))) and IsPrime(Seqint(Intseq(p) cat Intseq(p+1) cat Intseq(p+1)))]; // Marius A. Burtea, Aug 27 2019
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Robert Israel, Aug 26 2019
STATUS
approved