A262829 (3,2)-primes (defined in Comments).

2, 3, 7, 13, 31, 37, 43, 67, 79, 151, 157, 181, 193, 223, 241, 271, 283, 307, 331, 349, 373, 397, 409, 421, 433, 463, 499, 571, 613, 619, 631, 643, 661, 673, 691, 733, 757, 769, 787, 829, 853, 877, 937, 997, 1009, 1093, 1123, 1129, 1153, 1201, 1213, 1231

Offset

1,1

Comments

Let V = (b(1), b(2), ..., b(k)), where k > 1 and b(i) are distinct integers > 1 for j = 1..k. Call p a V-prime if the digits of p in base b(1) spell a prime in each of the bases b(2), ..., b(k).

Links

Clark Kimberling, Table of n, a(n) for n = 1..10000

Mathematica

{b1, b2} = {2, 3};
u = Select[Prime[Range[6000]], PrimeQ[FromDigits[IntegerDigits[#, b1], b2]] &]; (* A235266 *)
v = Select[Prime[Range[6000]], PrimeQ[FromDigits[IntegerDigits[#, b2], b1]] &];  (* A262829 *)
w = Intersection[u, v]; (* A262830 *)
(* Peter J. C. Moses, Sep 27 2015 *)

Crossrefs

Cf. A000040, A235266, A262730.

Sequence in context: A070218 A048456 A333313 * A071899 A242389 A102644

Adjacent sequences: A262826 A262827 A262828 * A262830 A262831 A262832

Keyword

nonn,easy,base

Author

Clark Kimberling, Oct 24 2015

Status

approved