|
|
A157902
|
|
a(n) is the smallest number greater than a(n-1) whose name in UK English contains n consonants.
|
|
0
|
|
|
1, 2, 3, 12, 13, 22, 23, 300, 1001, 1002, 1003, 1012, 1013, 1022, 1023, 1102, 1103, 1112, 1113, 1122, 1123, 1223, 1323, 2323, 3323, 12323, 13323, 22323, 23323, 101223, 101323, 102323, 103323, 112323, 113323, 122323, 123323, 223323, 323323, 1113323, 1122323, 1123323, 1223323, 1323323
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
In UK English, "1001" is written as "one thousand and one".
oNe = 1, TWo = 2, THRee = 3, TWeLVe = 4, THiRTeeN = 5, TWeNTyTWo = 6, TWeNTyTHRee = 7, 300 = THRee HuNDReD = 8, oNe THouSaND aND oNe = 9, oNe THouSaND aND TWo = 10, oNe THouSaND aND THRee = 11, oNe THouSaND aND TWeLVe = 12.
|
|
LINKS
|
|
|
PROG
|
(Python)
from num2words import num2words
from itertools import count, islice
def c(n): return sum(1 for c in num2words(n) if c in "bcdfghjklmnpqrstvwxz")
def agen():
n, adict = 1, dict()
for k in count(1):
v = c(k)
if v == n: yield k; n += 1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,word
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|