|
|
A124060
|
|
T totaler sequence. Number of t's in the American spelling of numbers.
|
|
1
|
|
|
0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 2, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 2, 2, 2, 2, 3, 2, 2, 2, 3, 3, 2, 2, 2, 2, 3, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,14
|
|
LINKS
|
|
|
EXAMPLE
|
The words "zero" and "one" have no t's, so a(0) = a(1) = 0.
The words "two" and "three" each have one t, so a(2) = a(3) = 1.
|
|
PROG
|
(PARI) total(n) = { local(a, i, j, sumt); a=["zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine", "ten", "eleven", "twelve", "thirteen", "fourteen", "fifteen", "sixteen", "seventeen", "eghteen", "nineteen", "twenty", "twentyone", "twentytwo", "twentythree", "twentyfour", "twentyfive", "twentysix", "twentyseven", "twentyeight", "twentynine", "thirty", "thirtyone", "thirtytwo", "thirtythree", "thirtyfour", "thirtyfive", "thirtysix", "thirtyseven", "thirtyeight", "thirtynine", "forty", "fortyone", "fortytwo", "fortythree", "fortyfour", "fortyfive", "fortysix", "fortyseven", "fortyeight", "fortynine", "fifty"]; for(i = 1, n, sumt=0; for(j=1, length(a[i]), if(mid(a[i], j, 1)=="t", sumt++) ); print1(sumt, ", ") ) }
\\ Get a substring of length n from string str starting at position s in str.
mid(str, s, n) = { local(v, ln, x, tmp); v =""; tmp = Vec(str); ln=length(tmp); for(x=s, s+n-1, v=concat(v, tmp[x]); ); return(v) }
(Python)
from num2words import num2words
def a(n): return num2words(n).count('t')
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,word
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|