|
|
A158353
|
|
a(n) is the smallest number greater than a(n-1) whose name in US English contains n vowels.
|
|
4
|
|
|
2, 3, 11, 14, 71, 101, 111, 114, 171, 1071, 1101, 1111, 1114, 1171, 11171, 14171, 71171, 101171, 111171, 114171, 171171, 1071171, 1101171, 1111171, 1114171, 1171171, 11171171, 14171171, 71171171, 101171171, 111171171, 114171171, 171171171, 1071171171, 1101171171
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
In US English, "101" is written as "one hundred one".
The sequence counts vowels by counting the instances of the letters 'a', 'e', 'i', 'o', 'u', and 'y' (see Example). If 'y' were not included, then a(5) = 102 ("OnE hUndrEd twO") is the first among subsequent value changes.
In extending the sequence to large numbers, the "American system" (Weisstein link), also known as the "short scale" (Wikipedia link), was used. Also, the common written form is adopted ("one thousand one hundred seventeen" not "eleven hundred seventeen"; Wilson link).
(End)
|
|
LINKS
|
|
|
EXAMPLE
|
"twO" has 1 vowel, "thrEE" has 2, "ElEvEn" has 3, "fOUrtEEn" has 4, "sEvEntY-OnE" has 5, "OnE hUndrEd OnE" has 6, "OnE hUndrEd ElEvEn" has 7.
|
|
PROG
|
(Python)
from num2words import num2words
def A158353upto(n):
i, ans = 1, []
for k in range(1, n+1):
while sum(1 for c in num2words(i).replace(' and ', '') if c in "aeiouy") != k:
i += 1
ans.append(i)
return ans
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,word
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|