|
Search: id:A130677
|
|
|
| A130677 |
|
Write the English name of 2^n and replace each letter by its rank in the alphabet. |
|
+0
1
|
|
| 15, 14, 5, 20, 23, 15, 6, 15, 21, 18, 5, 9, 7, 8, 20, 19, 9, 24, 20, 5, 5, 14
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
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.
Adjacent sequences: A130674 A130675 A130676 this_sequence A130678 A130679 A130680
Sequence in context: A129786 A104056 A131285 this_sequence A022971 A023457 A004456
|
|
KEYWORD
|
nonn,word,more,easy
|
|
AUTHOR
|
njas, Sep 21 2007
|
|
|
Search completed in 0.002 seconds
|
