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 A119890 #16 Nov 01 2024 20:47:36
%S A119890 11,23,41,43,61,101,113,131,151,223,241,311,313,331,401,421,601,1013,
%T A119890 1031,1033,1051,1103,1123,1213,1231,1301,1303,1321,2003,2111,2113,
%U A119890 2131,2203,2221,2311,3011,3121,3301,4001,4003,4021,4111,4201,5011,5101,10103
%N A119890 Prime duet leaders: largest number of a prime duet.
%C A119890 A prime duet is a pair of two different prime numbers such that the second number is a 1-digit number which is the sum of the digits of the first number.
%C A119890 The terms of the sequence must be at least 2 digits in length, so {5,5} is not a prime duet. - _Harvey P. Dale_, May 07 2021
%H A119890 David A. Corneth, <a href="/A119890/b119890.txt">Table of n, a(n) for n = 1..10000</a> (first 600 terms from Harvey P. Dale)
%H A119890 L. Stevens, <a href="http://www.lucstevens.com/Primeensembles.htm">Prime ensembles</a>
%H A119890 David A. Corneth, <a href="/A119890/a119890.gp.txt">PARI program</a>
%e A119890 113 is in the sequence because it is the largest number of the prime duet (113,5)
%t A119890 Select[Prime[Range[5,1300]],IntegerLength[Total[IntegerDigits[#]]]==1&&PrimeQ[Total[IntegerDigits[#]]]&] (* _Harvey P. Dale_, May 07 2021 *)
%o A119890 (PARI) \\ See PARI link. _David A. Corneth_, May 07 2021
%Y A119890 Cf. A119889, A119891, A119892.
%K A119890 nonn,base
%O A119890 1,1
%A A119890 Luc Stevens (lms022(AT)yahoo.com), May 27 2006
%E A119890 Corrected by _Harvey P. Dale_, May 07 2021