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 A143390 #11 Nov 20 2019 07:52:35
%S A143390 1,2,3,5,7,11,13,17,23,31,37,41,43,47,53,61,67,71,73,83,97,101,103,
%T A143390 107,113,131,137,167,173,197,211,223,241,271,283,307,311,313,317,331,
%U A143390 337,347,353,367,373,383,397,401,431,443,461,467,503,523,541,547,571,601
%N A143390 Numbers in which every suffix (in base 10) is 1 or a prime.
%C A143390 Subsequence of A042986 apart from first term; a(n+1)=A042986(n) for n<25.
%H A143390 Reinhard Zumkeller, <a href="/A143390/b143390.txt">Table of n, a(n) for n = 1..1000</a>
%t A143390 prQ[n_] := n == 1 || PrimeQ[n];
%t A143390 okQ[n_] := Module[{dd = IntegerDigits[n]}, AllTrue[Range[Length[dd]-1], prQ@ FromDigits@ Drop[dd, #]&]];
%t A143390 {1}~Join~Select[ Prime@Range[1000], okQ] (* _Jean-François Alcover_, Nov 20 2019 *)
%o A143390 (PARI) is(n)=my(d=digits(n,10)); for(i=1,#d-1, if(!isprime(fromdigits(d[i..#d],10)), return(0))); isprime(d[#d]) || d[#d]==1 \\ _Charles R Greathouse IV_, Nov 26 2016
%Y A143390 Cf. A012883, A012884.
%K A143390 nonn,base
%O A143390 1,2
%A A143390 _Reinhard Zumkeller_, Aug 13 2008