A099747 Duplicate of A059916.
0, 1, 2, 4, 5, 6, 8, 10, 40, 46, 60, 61, 64, 80, 84, 5000
Offset: 1
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.
from num2words import num2words as n2w
def letters(n):
return "".join(c for c in n2w(n, lang='es') if c.isalpha())
def ok(n):
w = letters(n)
return len(w) == len(set(w))
print([k for k in range(1, 100000) if ok(k)]) # Michael S. Branicky, Jun 08 2022
-4 is named as "moins quatre" (all letters different). 13 is not in the data as "treize" repeats "e".
from num2words import num2words as n2w
def letters(n):
return "".join(c for c in n2w(n, lang='fr') if c.isalpha())
def ok(n):
w = letters(n)
return len(w) == len(set(w))
print([k for k in range(-99, 1000) if ok(k)]) # Michael S. Branicky, Jun 08 2022
19 is in the sequence because two letters contribute to each of the two letter-frequencies of "nineteen": I & T to frequency 1, E & N to frequency 3. 5000 is in the sequence because twelve letters contribute to the only letter-frequency (1) of "five thousand". 3000000000000000013000019000000 is in the sequence because one letter contributes to each of the nine letter-frequencies of "three nonillion thirteen trillion nineteen million": M to frequency 1, H to 2, R to 3, O to 4, T to 5, L to 6, E to 7, I to 8, N to 9.
The first multi-digit term is 16 since "one" and "six" taken together contain no duplicate letters. Although "one" itself contains no duplicate letters, by definition 11 is not a term since duplicate digits introduce repeated letters.
is(n)=my(d=apply(k->[25,9,40,64,26,7,4,64,37,64][k+1], digits(n)),t); for(i=1,#d, if(bitand(t,d[i]), return(0)); t=bitor(t,d[i])); t<64 \\ Charles R Greathouse IV, Aug 18 2022
m = ["zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"]
def nr(w): return len(w) == len(set(w))
afull = [k for k in range(988) if nr("".join(m[int(d)] for d in str(k)))]
print(afull) # Michael S. Branicky, Aug 18 2022
Comments