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 A322474 #18 Dec 08 2019 02:07:09 %S A322474 11,19,41,61,89,101,109,149,151,181,191,199,211,227,241,251,257,277, %T A322474 281,349,389,401,409,419,421,449,461,491,499,521,541,557,577,587,601, %U A322474 619,641,661,691,727,757,787,809,811,821,827,857,877,881,887,911,919,941,991,1009,1019,1021,1049,1051,1061 %N A322474 Primes that are not base-10 deletable primes (written in base 10). %C A322474 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 A322474 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. Thus 2003 is in this sequence but not in A081027. %C A322474 Complement of all nonprimes and A305352. %H A322474 Robert Price, <a href="/A322474/b322474.txt">Table of n, a(n) for n = 1..530</a> %t A322474 b = 10; d = {}; %t A322474 p = Select[Range[2, 10000], PrimeQ[#] &]; %t A322474 For[i = 1, i <= Length[p], i++, %t A322474 c = IntegerDigits[p[[i]], b]; %t A322474 If[Length[c] == 1, AppendTo[d, p[[i]]]; Continue[]]; %t A322474 For[j = 1, j <= Length[c], j++, %t A322474 t = Delete[c, j]; %t A322474 If[t[[1]] == 0, Continue[]]; %t A322474 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 A322474 Cf. A080608, A080603, A096235-A096246, A321657, A305352, A081027. %K A322474 nonn,base,easy %O A322474 1,1 %A A322474 _Robert Price_, Dec 09 2018