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 A054750 #25 Mar 27 2025 21:31:25
%S A054750 2,3,5,7,29,67,89,199,599,2999,4999,29989,59999,79999,389999,989999,
%T A054750 6999899,8989999,59899999,89999999,289999999,799999999,3999998999,
%U A054750 19999997999,79999999999,399999998999,599999899999,999998999999
%N A054750 Smallest prime number whose digits sum to n-th prime.
%C A054750 a(n) >= A051885(A000040(n)). Indices n for which the equality holds are listed in A055019.
%C A054750 a(n) >= A046864(n). - _Michel Marcus_, Nov 01 2015
%H A054750 Chris Caldwell and G. L. Honaker, Jr., <a href="https://primes.utm.edu/curios/page.php?curio_id=18526">Prime curio for 8999</a>
%e A054750 a(7)=89 because 8+9=17 and 17 is the 7th prime.
%t A054750 a[n_]:=Module[{k=2}, While[DigitSum[k]!=Prime[n], k=NextPrime[k]]; k]; Array[a,15] (* _Stefano Spezia_, Mar 27 2025 *)
%o A054750 (PARI) a(n) = {my(k=2); my(p=prime(n)); while((sumdigits(k) != prime(n)), k=nextprime(k+1)); k;} \\ _Michel Marcus_, Nov 01 2015
%Y A054750 Cf. A000040, A067180, A046704, A046864, A068951, A007605.
%K A054750 base,nonn
%O A054750 1,1
%A A054750 _G. L. Honaker, Jr._, Apr 24 2000
%E A054750 More terms from Kok Seng Chua (chuaks(AT)ihpc.nus.edu.sg), May 31 2000
%E A054750 Edited and extended by _Robert G. Wilson v_, Feb 26 2002