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 A322472 #7 Dec 10 2018 02:41:33 %S A322472 13,17,37,73,89,97,109,113,127,131,139,149,151,157,197,227,251,257, %T A322472 271,277,293,307,311,313,337,359,379,397,409,419,421,433,439,457,463, %U A322472 487,499,503,521,523,541,569,577,587,599,601,613,617,619,631,653,661,683,733,739,743,757,761 %N A322472 Primes that are not base-9 deletable primes (written in base 10). %C A322472 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 A322472 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. %C A322472 Complement of all primes and A322471. %H A322472 Robert Price, <a href="/A322472/b322472.txt">Table of n, a(n) for n = 1..889</a> %t A322472 b = 9; d = {}; %t A322472 p = Select[Range[2, 10000], PrimeQ[#] &]; %t A322472 For[i = 1, i <= Length[p], i++, %t A322472 c = IntegerDigits[p[[i]], b]; %t A322472 If[Length[c] == 1, AppendTo[d, p[[i]]]; Continue[]]; %t A322472 For[j = 1, j <= Length[c], j++, %t A322472 t = Delete[c, j]; %t A322472 If[t[[1]] == 0, Continue[]]; %t A322472 If[MemberQ[d, FromDigits[t, b]], AppendTo[d, p[[i]]]; Break[]]]]; Complement[Table[Prime[n], {n, PrimePi[Last[d]]}], d] (* _Robert Price_, Dec 09 2018 *) %Y A322472 Cf. A080608, A080603, A096235-A096246, A321657. %K A322472 nonn,base,easy %O A322472 1,1 %A A322472 _Robert Price_, Dec 09 2018