The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049528 Number of letters in n-th prime (in English). 2
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, 15, 14, 18, 21, 19, 21, 20, 19, 18, 20, 20, 20, 22, 21, 19, 19, 21, 21, 20, 16, 21, 21, 20, 21, 20, 18, 18, 20, 20, 19, 20, 22, 19, 21, 21, 17, 18, 20, 21, 21, 23 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
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
a(n) = A005589(A000040(n)) since it does not count spaces or hyphens. - Michael S. Branicky, Jul 12 2022
EXAMPLE
a(13) = 8 because 'forty-one' contains 8 letters (not counting the hyphen).
PROG
(Python)
from sympy import nextprime
from itertools import count, islice
from num2words import num2words as n2w
def f(n): return sum(1 for c in n2w(n).replace(" and", "") if c.isalpha())
def agen(p=2):
while True: yield f(p); p = nextprime(p)
print(list(islice(agen(), 68))) # Michael S. Branicky, Jul 12 2022
CROSSREFS
Sequence in context: A077861 A272647 A076308 * A206035 A200100 A057759
KEYWORD
easy,nice,nonn,word
AUTHOR
EXTENSIONS
a(66) and beyond from Michael S. Branicky, Jul 12 2022
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 13 01:02 EDT 2024. Contains 372497 sequences. (Running on oeis4.)