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 A155833 #11 Jul 21 2020 15:16:30
%S A155833 2,3,5,7,11,31,41,43,53,61,71,73,83,97,131,151,181,191,211,241,251,
%T A155833 271,281,311,331,353,373,383,421,431,433,443,461,463,491,521,541,563,
%U A155833 571,593,631,641,643,653,661,673,683,691,733,743,751,761,773,787,797,811
%N A155833 Primes in which smallest digit is final digit.
%C A155833 The final digit does not have to be the only smallest digit, so 211 is a term even though the second digit as well as the last digit equals 1. - _Harvey P. Dale_, Jul 21 2020
%p A155833 A010879 := proc(n) n mod 10 ; end: A054054 := proc(n) min(op(convert(n,base,10))) ; end: for i from 1 to 500 do p := ithprime(i) ; if A010879(p) = A054054(p) then printf("%d,",p) ; fi; od: # _R. J. Mathar_, Jan 31 2009
%t A155833 Select[Prime[Range[150]],Min[IntegerDigits[#]]==IntegerDigits[#][[-1]]&] (* _Harvey P. Dale_, Jul 21 2020 *)
%o A155833 (PARI) is(n)=my(d=digits(n));d[#d]==vecsort(d)[1] && isprime(n) \\ _Charles R Greathouse IV_, Dec 29 2012
%Y A155833 Subsequence of A038618.
%K A155833 nonn,base
%O A155833 1,1
%A A155833 _Juri-Stepan Gerasimov_, Jan 28 2009
%E A155833 Corrected by _R. J. Mathar_, Jan 31 2009