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 A262836 #10 Nov 09 2015 16:23:25
%S A262836 2,3,5,7,17,29,31,37,41,67,79,97,101,109,139,149,151,229,269,271,311,
%T A262836 367,457,491,701,797,829,857,911,929,977,1039,1129,1181,1231,1381,
%U A262836 1429,1481,1637,1759,1861,1949,1951,2011,2281,2297,2467,2521,2557,2659,2671
%N A262836 {3,5}-primes (defined in Comments).
%C A262836 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)).
%H A262836 Clark Kimberling, <a href="/A262836/b262836.txt">Table of n, a(n) for n = 1..1000</a>
%t A262836 {b1, b2} = {3, 5};
%t A262836 u = Select[Prime[Range[6000]], PrimeQ[FromDigits[IntegerDigits[#, b1], b2]] &]; (* A231474 *)
%t A262836 v = Select[Prime[Range[6000]], PrimeQ[FromDigits[IntegerDigits[#, b2], b1]] &]; (* A262835 *)
%t A262836 w = Intersection[u, v]; (* A262836 *)
%t A262836 (* _Peter J. C. Moses_, Sep 27 2015 *)
%Y A262836 Cf. A000040, A231474, A262835, A262829.
%K A262836 nonn,easy,base
%O A262836 1,1
%A A262836 _Clark Kimberling_, Nov 05 2015