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 A322444 #8 Dec 08 2018 21:54:46 %S A322444 71,73,79,97,103,113,127,149,173,193,227,241,257,263,271,281,283,307, %T A322444 311,313,409,419,433,439,449,457,463,487,503,521,569,577,587,593,599, %U A322444 607,617,631,641,647,653,661,673,701,727,733,739,743,757,769,823,827,839,881,887,907,911,919,929 %N A322444 Primes that are not base-8 deletable primes (written in base 10). %C A322444 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 A322444 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 A322444 Complement of all primes and A322443 . %H A322444 Robert Price, <a href="/A322444/b322444.txt">Table of n, a(n) for n = 1..660</a> %t A322444 b = 8; d = {}; %t A322444 p = Select[Range[2, 10000], PrimeQ[#] &]; %t A322444 For[i = 1, i <= Length[p], i++, %t A322444 c = IntegerDigits[p[[i]], b]; %t A322444 If[Length[c] == 1, AppendTo[d, p[[i]]]; Continue[]]; %t A322444 For[j = 1, j <= Length[c], j++, %t A322444 t = Delete[c, j]; %t A322444 If[t[[1]] == 0, Continue[]]; %t A322444 If[MemberQ[d, FromDigits[t, b]], AppendTo[d, p[[i]]]; Break[]]]]; Complement[Table[Prime[n], {n, PrimePi[Last[d]]}], d] (* _Robert Price_, Dec 08 2018 *) %Y A322444 Cf. A080608, A080603, A096235-A096246, A321657. %K A322444 nonn,base,easy %O A322444 1,1 %A A322444 _Robert Price_, Dec 08 2018