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 A101988 #9 Feb 15 2015 16:07:33
%S A101988 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,3,7,8,3,9,6,9,11,6,
%T A101988 6,3,7,7,8,11,10,3,5,6,10,5,3,6,4,5,6,6,4,4,4,4,3,6,5,3,6,6,9,9,8,11,
%U A101988 8,10,8,4,6,7,7,10,10,5,6,10,3,1,6,4,6,5,4,4,1,5,4,4,5,6,3,6,1,7,5,4,6,3,5,4
%N A101988 Number of primes (with repetition) that can be formed from digits of the n-th prime.
%C A101988 Here we put all the digits of prime(n) into a bag and ask how many not necessarily distinct primes can be formed using some or all of these digits.
%e A101988 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 A101988 (* first do *) Needs["DiscreteMath`Combinatorica`"] (* then *) f[n_] := Length[ Select[ FromDigits /@ Flatten[ Permutations /@ Subsets[ IntegerDigits[ Prime[n]]], 1], PrimeQ[ # ] &] ]; Table[ f[n], {n, 102}] (* _Robert G. Wilson v_, Feb 10 2005 *)
%Y A101988 Cf. A039992, A045719.
%K A101988 base,easy,nonn
%O A101988 1,6
%A A101988 _Zak Seidov_, Jan 29 2005
%E A101988 Corrected and extended by _Robert G. Wilson v_, Feb 10 2005
%E A101988 Definition clarified by _Ray Chandler_, Mar 01 2005