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 A322173 #14 Dec 06 2018 19:23:32 %S A322173 2,3,5,11,13,17,19,23,29,31,41,47,53,59,67,71,73,79,83,89,97,101,103, %T A322173 107,109,113,127,131,137,139,149,157,163,167,173,179,181,191,193,197, %U A322173 199,211,227,233,239,251,257,263,269,281,283,293,311,313,317,347,353,359,373,379,383,389,397 %N A322173 Base-6 deletable primes (written in base 10). %C A322173 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 A322173 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 A322173 Robert Price, <a href="/A322173/b322173.txt">Table of n, a(n) for n = 1..3561</a> %t A322173 b = 6; d = {}; %t A322173 p = Select[Range[2, 10000], PrimeQ[#] &]; %t A322173 For[i = 1, i <= Length[p], i++, %t A322173 c = IntegerDigits[p[[i]], b]; %t A322173 If[Length[c] == 1, AppendTo[d, p[[i]]]; Continue[]]; %t A322173 For[j = 1, j <= Length[c], j++, %t A322173 t = Delete[c, j]; %t A322173 If[t[[1]] == 0, Continue[]]; %t A322173 If[MemberQ[d, FromDigits[t, b]], AppendTo[d, p[[i]]]; Break[]]]]; %t A322173 d (* _Robert Price_, Dec 06 2018 *) %Y A322173 Cf. A080608, A080603, A096235-A096246. %K A322173 nonn,base,easy %O A322173 1,1 %A A322173 _Robert Price_, Nov 29 2018