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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130677 Write the English name of 2^n and replace each letter with its rank in the alphabet. 0
15, 14, 5, 20, 23, 15, 6, 15, 21, 18, 5, 9, 7, 8, 20, 19, 9, 24, 20, 5, 5, 14, 20, 8, 9, 18, 20, 25, 20, 23, 15, 19, 9, 24, 20, 25, 6, 15, 21, 18, 15, 14, 5, 8, 21, 14, 4, 18, 5, 4, 20, 23, 5, 14, 20, 25, 5, 9, 7, 8, 20, 20, 23, 15, 8, 21, 14, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..67.

EXAMPLE

One, two, four, eight, ... gives 15,14,5, 20,23,15, 6,15,21,18, 5,9,7,8,20, ...

CROSSREFS

Suggested by A131744.

Sequence in context: A129786 A104056 A131285 * A022971 A023457 A004456

Adjacent sequences:  A130674 A130675 A130676 * A130678 A130679 A130680

KEYWORD

nonn,word,easy

AUTHOR

N. J. A. Sloane, Sep 21 2007

EXTENSIONS

More terms from Sean A. Irvine, Sep 27 2011

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified November 19 03:59 EST 2017. Contains 294912 sequences.