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 A062332 #30 Jun 29 2018 03:57:21
%S A062332 11,101,131,151,181,191,1021,1031,1051,1061,1091,1151,1171,1181,1201,
%T A062332 1231,1291,1301,1321,1361,1381,1451,1471,1481,1511,1531,1571,1601,
%U A062332 1621,1721,1741,1801,1811,1831,1861,1871,1901,1931,1951,10061,10091,10111,10141
%N A062332 Primes starting and ending with 1.
%C A062332 Complement of A208261 (nonprime numbers with all divisors starting and ending with digit 1) with respect to A208262 (numbers with all divisors starting and ending with digit 1). - _Jaroslav Krizek_, Mar 04 2012
%C A062332 Intersection of A030430 and A045707. - _Michel Marcus_, Jun 08 2013
%H A062332 Harry J. Smith, <a href="/A062332/b062332.txt">Table of n, a(n) for n = 1..1000</a>
%F A062332 A010051(a(n)) * A000030(a(n)) * (a(n) mod 10) = 1. - _Reinhard Zumkeller_, Jul 16 2014
%e A062332 102701 is a member as it is a prime and the first and the last digits are both 1.
%t A062332 fl1Q[n_]:=Module[{idn=IntegerDigits[n]},First[idn]==Last[idn]==1]; Select[ Prime[Range[1300]],fl1Q] (* _Harvey P. Dale_, Apr 30 2012 *)
%o A062332 (PARI) { n=-1; t=log(10); forprime (p=2, 5*10^5, if ((p-10*(p\10)) == 1 && (p\10^(log(p)\t)) == 1, write("b062332.txt", n++, " ", p); if (n==1000, break)) ) } \\ _Harry J. Smith_, Aug 05 2009
%o A062332 (Haskell)
%o A062332 a062332 n = a062332_list !! (n-1)
%o A062332 a062332_list = filter ((== 1) . a010051') a208259_list
%o A062332 -- _Reinhard Zumkeller_, Jul 16 2014
%Y A062332 Cf. A208259 (Numbers starting and ending with digit 1).
%Y A062332 Cf. A010051, A017281, A131835, A000030.
%K A062332 nonn,base,easy
%O A062332 1,1
%A A062332 _Amarnath Murthy_, Jun 21 2001
%E A062332 Corrected and extended by Larry Reeves (larryr(AT)acm.org), Jun 29 2001
%E A062332 Missing term a(36)=1901 added by _Harry J. Smith_, Aug 05 2009