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 A081027 #17 Jan 27 2023 15:33:45 %S A081027 11,19,41,61,89,101,109,149,151,181,191,199,211,227,241,251,257,277, %T A081027 281,349,389,401,409,419,421,449,461,491,499,521,541,557,577,587,601, %U A081027 619,641,661,691,727,757,787,809,811,821,827,857,877,881,887,911,919,941 %N A081027 Primes that are not in A080608. %C A081027 Repeated removal of a single digit must eventually result in a nonprime. %C A081027 Undeletable primes. - _Arkadiusz Wesolowski_, Oct 18 2011 %H A081027 Michael S. Branicky, <a href="/A081027/b081027.txt">Table of n, a(n) for n = 1..10000</a> %o A081027 (Python) %o A081027 from sympy import isprime, prevprime %o A081027 def c(n): %o A081027 if not isprime(n): return False %o A081027 if n < 10: return True %o A081027 s = str(n) %o A081027 si = (s[:i]+s[i+1:] for i in range(len(s))) %o A081027 return any(t[0] != '0' and c(int(t)) for t in si) %o A081027 def ok(n): %o A081027 return isprime(n) and not c(n) %o A081027 print([k for k in range(942) if ok(k)]) # _Michael S. Branicky_, Jan 27 2023 %Y A081027 Cf. A080608. %K A081027 nonn,base %O A081027 1,1 %A A081027 _David W. Wilson_, Mar 02 2003