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 A049528 #11 Jul 12 2022 13:00:36
%S A049528 3,5,4,5,6,8,9,8,11,10,9,11,8,10,10,10,9,8,10,10,12,11,11,10,11,13,15,
%T A049528 15,14,18,21,19,21,20,19,18,20,20,20,22,21,19,19,21,21,20,16,21,21,20,
%U A049528 21,20,18,18,20,20,19,20,22,19,21,21,17,18,20,21,21,23
%N A049528 Number of letters in n-th prime (in English).
%H A049528 Michael S. Branicky, <a href="/A049528/b049528.txt">Table of n, a(n) for n = 1..10000</a>
%F A049528 a(n) = A005589(A000040(n)) or a(n) = A052360(A000040(n)) depending on whether hyphens and spaces are excluded or included. - _Jonathan Vos Post_, Oct 19 2007
%F A049528 a(n) = A005589(A000040(n)) since it does not count spaces or hyphens. - _Michael S. Branicky_, Jul 12 2022
%e A049528 a(13) = 8 because 'forty-one' contains 8 letters (not counting the hyphen).
%o A049528 (Python)
%o A049528 from sympy import nextprime
%o A049528 from itertools import count, islice
%o A049528 from num2words import num2words as n2w
%o A049528 def f(n): return sum(1 for c in n2w(n).replace(" and", "") if c.isalpha())
%o A049528 def agen(p=2):
%o A049528 while True: yield f(p); p = nextprime(p)
%o A049528 print(list(islice(agen(), 68))) # _Michael S. Branicky_, Jul 12 2022
%Y A049528 Cf. A000040, A005589, A052360.
%K A049528 easy,nice,nonn,word
%O A049528 1,1
%A A049528 _G. L. Honaker, Jr._
%E A049528 a(66) and beyond from _Michael S. Branicky_, Jul 12 2022