A262836 {3,5}-primes (defined in Comments).

2, 3, 5, 7, 17, 29, 31, 37, 41, 67, 79, 97, 101, 109, 139, 149, 151, 229, 269, 271, 311, 367, 457, 491, 701, 797, 829, 857, 911, 929, 977, 1039, 1129, 1181, 1231, 1381, 1429, 1481, 1637, 1759, 1861, 1949, 1951, 2011, 2281, 2297, 2467, 2521, 2557, 2659, 2671

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, 5};
u = Select[Prime[Range[6000]], PrimeQ[FromDigits[IntegerDigits[#, b1], b2]] &]; (* A231474 *)
v = Select[Prime[Range[6000]], PrimeQ[FromDigits[IntegerDigits[#, b2], b1]] &]; (* A262835 *)
w = Intersection[u, v]; (* A262836 *)
(* Peter J. C. Moses, Sep 27 2015 *)

Crossrefs

Cf. A000040, A231474, A262835, A262829.

Sequence in context: A248344 A060212 A107439 * A356475 A178382 A360591

Adjacent sequences: A262833 A262834 A262835 * A262837 A262838 A262839

Keyword

nonn,easy,base

Author

Clark Kimberling, Nov 05 2015

Status

approved