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 A262837 #6 Nov 24 2015 01:42:08 %S A262837 2,3,5,7,11,19,23,29,37,43,47,53,61,67,71,79,89,103,107,127,137,149, %T A262837 151,173,179,191,197,211,229,233,257,271,277,281,331,337,347,373,379, %U A262837 383,397,401,439,443,457,467,487,499,523,547,557,571,599,607,653,673 %N A262837 (3,7)-primes (defined in Comments). %C A262837 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). %H A262837 Clark Kimberling, <a href="/A262837/b262837.txt">Table of n, a(n) for n = 1..10000</a> %t A262837 {b1, b2} = {3, 7}; %t A262837 u = Select[Prime[Range[6000]], PrimeQ[FromDigits[IntegerDigits[#, b1], b2]] &]; (* A231477 *) %t A262837 v = Select[Prime[Range[6000]], PrimeQ[FromDigits[IntegerDigits[#, b2], b1]] &]; (* A262837 *) %t A262837 w = Intersection[u, v]; (* A262838 *) %t A262837 (* _Peter J. C. Moses_, Sep 27 2015 *) %Y A262837 Cf. A000040, A231477, A262838, A262829. %K A262837 nonn,easy,base %O A262837 1,1 %A A262837 _Clark Kimberling_, Nov 09 2015