OFFSET
1,1
COMMENTS
Let S = {b(1), b(2), ..., b(k)}, where k > 1 and b(i) are distinct integers > 1 for j = 1..k. Call p an S-prime if the digits of p in base b(i) spell a prime in each of the bases b(j) in S, for i = 1..k. Equivalently, p is an S-prime if p is a strong-V prime (defined at A262729) for every permutation of the vector V = (b(1), b(2), ..., b(k)).
LINKS
Clark Kimberling, Table of n, a(n) for n = 1..1000
MATHEMATICA
{b1, b2} = {3, 7};
u = Select[Prime[Range[6000]], PrimeQ[FromDigits[IntegerDigits[#, b1], b2]] &]; (* A231477 *)
v = Select[Prime[Range[6000]], PrimeQ[FromDigits[IntegerDigits[#, b2], b1]] &]; (* A262837 *)
w = Intersection[u, v]; (* A262838 *)
(* Peter J. C. Moses, Sep 27 2015 *)
CROSSREFS
KEYWORD
nonn,easy,base
AUTHOR
Clark Kimberling, Nov 09 2015
STATUS
approved