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 A322475 #7 Dec 10 2018 02:40:31 %S A322475 2,3,5,7,13,23,29,31,37,41,43,47,59,61,71,73,79,83,101,113,149,151, %T A322475 167,211,233,251,257,263,271,283,293,313,317,331,337,347,349,353,359, %U A322475 367,373,389,409,433,439,457,461,479,487,509,521,523,557,563,631,653,659,673,677,719,733,739 %N A322475 Base-11 deletable primes (written in base 10). %C A322475 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 A322475 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 A322475 Robert Price, <a href="/A322475/b322475.txt">Table of n, a(n) for n = 1..304</a> %t A322475 b = 11; d = {}; %t A322475 p = Select[Range[2, 10000], PrimeQ[#] &]; %t A322475 For[i = 1, i <= Length[p], i++, %t A322475 c = IntegerDigits[p[[i]], b]; %t A322475 If[Length[c] == 1, AppendTo[d, p[[i]]]; Continue[]]; %t A322475 For[j = 1, j <= Length[c], j++, %t A322475 t = Delete[c, j]; %t A322475 If[t[[1]] == 0, Continue[]]; %t A322475 If[MemberQ[d, FromDigits[t, b]], AppendTo[d, p[[i]]]; Break[]]]]; %t A322475 d (* _Robert Price_, Dec 09 2018 *) %Y A322475 Cf. A080608, A080603, A096235-A096246. %K A322475 nonn,base,easy %O A322475 1,1 %A A322475 _Robert Price_, Dec 09 2018