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 A039992 #10 Mar 20 2015 17:35:05
%S A039992 1,1,1,1,1,3,3,1,3,2,3,4,1,2,2,3,2,1,2,3,4,3,2,1,3,2,4,5,2,7,6,7,11,6,
%T A039992 6,3,7,7,8,11,10,3,4,6,10,4,3,4,3,3,4,6,4,4,4,4,3,6,4,3,6,6,5,7,5,11,
%U A039992 5,7,8,4,4,7,7,7,10,3,6,10,2,1,6,4,6,3,4,3,1,5,4,4,5,6,3,6,1,4,3,4,6,3,5
%N A039992 Number of distinct primes embedded in prime p(n).
%C A039992 a(n) counts permuted subsequences of digits of p(n) which denote primes.
%C A039992 We put all the digits of prime(n) into a bag and ask how many distinct primes can be formed using some or all of these digits.
%e A039992 a(35)=6 because from the digits of p(35)=149, six numbers can be formed, 19, 41, 149, 419, 491 & 941, which are primes.
%t A039992 Needs["DiscreteMath`Combinatorica`"]; f[n_] := Length[ Union[ Select[ FromDigits /@ Flatten[ Permutations /@ Subsets[ IntegerDigits[ Prime[n]]], 1], PrimeQ]]]; Table[f[n], {n, 102}] (* _Ray Chandler_ and _Robert G. Wilson v_, Feb 25 2005 *)
%Y A039992 a(n) = A045719(n)+1 = A039993(p(n)) A101988 gives another version.
%K A039992 nonn,base
%O A039992 1,6
%A A039992 _David W. Wilson_