|
|
A132204
|
|
Sum of the numerical equivalents for the 23 Latin letters, according to Tartaglia, of the letters in the English name of n, excluding spaces and hyphens.
|
|
0
|
|
|
2341, 351, 0, 940, 0, 296, 81, 665, 1011, 431, 500
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
Which are the fixed points n such that a(n) = n? Which n have prime a(n)? What are the equivalence classes of integers that have the same a(n)? Which n divide a(n)? Which n have a(n) that can be read as binary, as with a(8) = 1011? What is the sequence of n such that a(n) = 0 (i.e. the English name on n contains a J, U, or W)?
This sequence seems unnatural, since English uses three letters that were not in the Latin alphabet (W, U, J). A better sequence would first write the names of the numbers in Latin (cf. A132984) and then sum the values of the letters. - N. J. A. Sloane, Nov 30 2007
|
|
LINKS
|
|
|
EXAMPLE
|
a(2) = 0 because "TWO" contains a "W" which is not one of Tartaglia's letters.
a(3) = A132475(THREE) = 160 + 200 + 80 + 250 + 250 = 940.
a(4) = 0 because "FOUR" contains a "U" which is not one of Tartaglia's letters.
a(5) = A132475(FIVE) = 40 + 1 + 5 + 250 = 296.
a(6) = A132475(SIX) = 70 + 1 + 10 = 81.
a(7) = A132475(SEVEN) = 70 + 250 + 5 + 250 + 90 = 665.
a(8) = A132475(EIGHT) = 250 + 1 + 400 + 200 + 160 = 1011.
a(9) = A132475(NINE) = 90 + 1 + 90 + 250 = 431.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,word
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|