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 A052494 #13 Dec 14 2014 02:04:11
%S A052494 1,1,1,1,1,2,2,1,1,1,2,2,1,1,1,1,1,1,1,2,2,2,1,1,2,1,1,2,1,3,2,3,3,2,
%T A052494 4,1,3,3,3,3,4,2,2,2,4,3,1,1,1,1,1,2,2,2,1,1,1,2,2,2,2,2,1,3,2,3,2,3,
%U A052494 2,2,1,3,2,3,4,1,3,4,1,1,4,2,1,1,2,1,1,2,2,2,2,2,1,4,1,1,1,2,1,1,2,1,2,2,3
%N A052494 Number of different primes that can be formed by permuting digits of n-th prime.
%C A052494 Leading zeros not permitted, so, e.g., prime(27) = 103 but a(27) = 1 even though 13 and 31 are both primes. - _Harvey P. Dale_, Dec 17 2012
%e A052494 a(75)=4 because the digits in 379 may be arranged to form a total of 4 primes: 379, 397, 739 and 937.
%t A052494 ndp[n_]:=Module[{pers=FromDigits/@Permutations[IntegerDigits[n]]}, Count[ pers,_?(IntegerLength[#]==IntegerLength[n]&&PrimeQ[#]&)]]; ndp/@ Prime[ Range[110]] (* _Harvey P. Dale_, Dec 17 2012 *)
%Y A052494 A039999, A046810.
%K A052494 base,easy,nonn
%O A052494 2,6
%A A052494 _Enoch Haga_, Mar 16 2000