login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072959 Using the US English name for the nonnegative integers, assign each letter a numerical value as in A073327 (A=1, B=2, ..., Z=26) and treat the name as a base-27 integer. Convert to decimal. 2
515904, 11318, 15216, 10799546, 129618, 125258, 14118, 10211981, 2839691, 282506, 14729, 78236429, 299309045, 212445531527, 68884716992, 2457249197, 7503281492, 5427065792075, 55893641747, 150135668600, 299310469 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

For names with spaces (e.g. ONE HUNDRED), treat each space as a '0', or place holder, in the base 27 system. (Therefore ONE HUNDRED = 3196540902115084).

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

Sequence in context: A205899 A068816 A087096 * A048527 A157803 A186180

Adjacent sequences:  A072956 A072957 A072958 * A072960 A072961 A072962

KEYWORD

easy,nonn,word

AUTHOR

Michael Joseph Halm (hierogamous(AT)lycos.com), Aug 13 2002

EXTENSIONS

Definition rephrased by Matthew Goers (matthewgoers(AT)msn.com), Nov 03 2009

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

Edited by N. J. A. Sloane, Aug 15 2010 at the suggestion of D. S. McNeil

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 13:28 EST 2012. Contains 206031 sequences.