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 A321700 #12 Dec 06 2018 19:24:41 %S A321700 2,3,7,11,13,17,19,23,37,47,53,59,61,67,71,73,79,89,97,103,107,113, %T A321700 137,197,227,239,263,269,271,307,311,317,337,347,353,359,367,373,379, %U A321700 389,397,439,449,479,487,503,523,547,557,563,569,571,607,613,677,727,739,887,947,977 %N A321700 Base-5 deletable primes (written in base 10). %C A321700 A prime p is a base-b deletable prime if when written in base b it has the property that removing some digit leaves either the empty string or another deletable prime. %C A321700 Deleting a digit cannot leave any leading zeros in the new string. For example, deleting the 2 in 2003 to obtain 003 is not allowed. %H A321700 Robert Price, <a href="/A321700/b321700.txt">Table of n, a(n) for n = 1..1511</a> %t A321700 b = 5; d = {}; %t A321700 p = Select[Range[2, 10000], PrimeQ[#] &]; %t A321700 For[i = 1, i <= Length[p], i++, %t A321700 c = IntegerDigits[p[[i]], b]; %t A321700 If[Length[c] == 1, AppendTo[d, p[[i]]]; Continue[]]; %t A321700 For[j = 1, j <= Length[c], j++, %t A321700 t = Delete[c, j]; %t A321700 If[t[[1]] == 0, Continue[]]; %t A321700 If[MemberQ[d, FromDigits[t, b]], AppendTo[d, p[[i]]]; Break[]]]]; %t A321700 d (* _Robert Price_, Dec 06 2018 *) %Y A321700 Cf. A080608, A080603, A096235-A096246. %K A321700 nonn,base,easy %O A321700 1,1 %A A321700 _Robert Price_, Nov 17 2018