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 A052029 #17 Mar 21 2015 04:55:31
%S A052029 7,43,71,163,199,283,307,367,463,571,757,1033,1163,1627,1873,2683,
%T A052029 3041,3691,3967,4483,4651,4729,4951,4973,5407,6073,6961,7351,7537,
%U A052029 8053,8599,9103,9817,10321,10831,11251,11383,11743,12433,12853,13219,14419,14479
%N A052029 Primes base 10 that remain primes in five bases b, 2<=b<=10, expansions interpreted as decimal numbers.
%H A052029 Sebastian Petzelberger, <a href="/A052029/b052029.txt">Table of n, a(n) for n = 1..10000</a>
%H A052029 C. Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_024.htm">PP&P Puzzle 24: Primes in several bases</a>
%t A052029 Select[Prime[Range@ 1800], Count[PrimeQ /@ Table[FromDigits[IntegerDigits[#, i]], {i, 2, 10}], True] == 5 &] (* _Michael De Vlieger_, Mar 20 2015, after _Harvey P. Dale_ at A052032 *)
%o A052029 (PARI) lista(nn, nb=5) = {forprime(p=2, nn, if (sum(b=2, 10, isprime(subst(Pol(digits(p, b)), x, 10))) == nb, print1(p, ", ")););} \\ _Michel Marcus_, Mar 21 2015
%Y A052029 Cf. A038537, A052026-A052033.
%K A052029 nonn,base
%O A052029 1,1
%A A052029 _Patrick De Geest_, Dec 15 1999