|
Search: id:A072959
|
|
|
| A072959 |
|
a(n) = the name of n evaluated in base 27, using blank=0, hyphen=0, A=1, B=2,... Z=26. |
|
+0
2
|
|
| 515904, 11318, 15216, 10799546, 129618, 125258, 14118, 10211981, 2839691, 282506, 14729, 78236429, 299309045, 212445531527, 68884716992, 2457249197, 7503281492, 5427065792075, 55893641747, 150135668600, 299310469
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
English name for the number n transliterated into Lee Sallows' base-27 system.
|
|
REFERENCES
|
M. J. Halm, Sequences (Re)discovered, Mpossibilities 81 (Aug. 2002).
|
|
LINKS
|
M. J. Halm, Jootsy Calculus.
|
|
FORMULA
|
In Sallows' system, space = 0, A = 1, B = 2, etc. to Z = 26, so that words and phrases, even number names, can be transformed into numbers
|
|
EXAMPLE
|
a(1) = 11318 because o(729) + n(27) + e = 10935 + 378 + 5 = 11318
a(2) = 15216 because "TWO" in base 27 gives 20*27^2+23*27+15 = 15216.
|
|
MAPLE
|
(Maple code from R. J. Mathar)
lSallow27 := proc(s)
local a, i, c ;
a := 0 ;
for i from 1 to length(s) do
c := substring(s, i) ;
if c = " " then
a := 27*a ;
else
a := 27*a + StringTools[Ord](c) -96 ;
fi;
od:
a ;
end:
enums := ["one", "two", "three", "four", "five", "six", "seven", "eight", "nine", "ten",
"eleven", "twelve", "thirteen", "fourteen", "fifteen", "sixteen", "seventeen",
"eighteen", "nineteen", "twenty"]:
for i from 1 to nops(enums) do
printf("%d %d\n", i, lSallow27(enums[i])) ;
od:
|
|
CROSSREFS
|
Adjacent sequences: A072956 A072957 A072958 this_sequence A072960 A072961 A072962
Sequence in context: A136352 A138207 A068816 this_sequence A048527 A157803 A013695
|
|
KEYWORD
|
easy,nonn,word
|
|
AUTHOR
|
Michael Joseph Halm (hierogamous(AT)lycos.com), Aug 13 2002
|
|
EXTENSIONS
|
The old version of this sequence was wrong. Don Reble (djr(AT)nk.ca) and R. J. Mathar (mathar(AT)strw.leidenuniv.nl) supplied a corrected version. Edited by N. J. A. Sloane, Sep 20 2009
|
|
|
Search completed in 0.002 seconds
|
