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 A322476 #7 Dec 10 2018 02:41:05 %S A322476 11,17,19,53,67,89,97,103,107,109,127,131,137,139,157,163,173,179,181, %T A322476 191,193,197,199,223,227,229,239,241,269,277,281,307,311,379,383,397, %U A322476 401,419,421,431,443,449,463,467,491,499,503,541,547,569,571,577,587,593,599,601,607,613 %N A322476 Primes that are not base-11 deletable primes (written in base 10). %C A322476 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 A322476 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 A322476 Complement of all primes and A322475. %H A322476 Robert Price, <a href="/A322476/b322476.txt">Table of n, a(n) for n = 1..890</a> %t A322476 b = 11; d = {}; %t A322476 p = Select[Range[2, 10000], PrimeQ[#] &]; %t A322476 For[i = 1, i <= Length[p], i++, %t A322476 c = IntegerDigits[p[[i]], b]; %t A322476 If[Length[c] == 1, AppendTo[d, p[[i]]]; Continue[]]; %t A322476 For[j = 1, j <= Length[c], j++, %t A322476 t = Delete[c, j]; %t A322476 If[t[[1]] == 0, Continue[]]; %t A322476 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 A322476 Cf. A080608, A080603, A096235-A096246, A321657. %K A322476 nonn,base,easy %O A322476 1,1 %A A322476 _Robert Price_, Dec 09 2018