cp's OEIS Frontend

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.

A236303 Prime numbers n such that replacing each digit d in decimal expansion of n with prime(d) produces a prime. Zeros are not allowed.

This page as a plain text file.
%I A236303 #12 Mar 30 2017 22:29:10
%S A236303 2,3,5,7,19,59,79,167,229,347,439,449,467,487,547,569,617,727,787,859,
%T A236303 877,967,1289,1399,1549,1619,1699,1747,1777,1879,1997,1999,2129,2297,
%U A236303 2417,2437,2447,2647,2659,2687,2699,2729,2819,2857,3119,3137,3167,3229,3347
%N A236303 Prime numbers n such that replacing each digit d in decimal expansion of n with prime(d) produces a prime. Zeros are not allowed.
%H A236303 Vincenzo Librandi, <a href="/A236303/b236303.txt">Table of n, a(n) for n = 1..1000</a>
%e A236303 347 is in the sequence because 347 becomes 5717 which is also prime, where 5717 is the concatenation (prime(3),prime(4),prime(7))= (5,7,17).
%t A236303 lst={}; f[n_]:=Block[{a=IntegerDigits[n], b="", k=1, l}, l=Length[a]; While[k<l+1, b=StringJoin[b, ToString[Prime[a[[k]]]]]; k++]; ToExpression[b]]; Do[If[PrimeQ[f[Prime[n]]], AppendTo[lst, Prime[n]]], {n, 1, 600}]; lst
%Y A236303 Cf. A068492.
%K A236303 nonn,base
%O A236303 1,1
%A A236303 _Michel Lagneau_, Apr 21 2014