|
|
A104059
|
|
Each number is the rank in the alphabet of a letter (and "0" stands for a space). After substitution one reads (in English): "twenty twentythree five fourteen twenty twentyfive zero..." which is exactly the sequence itself (without hyphens).
|
|
7
|
|
|
20, 23, 5, 14, 20, 25, 0, 20, 23, 5, 14, 20, 25, 20, 8, 18, 5, 5, 0, 6, 9, 22, 5, 0, 6, 15, 21, 18, 20, 5, 5, 14, 0, 20, 23, 5, 14, 20, 25, 0, 20, 23, 5, 14, 20, 25, 6, 9, 22, 5, 0, 26, 5, 18, 15, 0, 20, 23, 5, 14, 20, 25, 0, 20, 23, 5, 14, 20, 25, 20, 8, 18, 5, 5, 0, 6, 9, 22, 5, 0, 6, 15
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
MAPLE
|
nlim := 82: words := ["zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine", "ten", "eleven", "twelve", "thirteen", "fourteen", "fifteen", "sixteen", "seventeen", "eighteen", "nineteen", "twenty", "twentyone", "twentytwo", "twentythree", "twentyfour", "twentyfive", "twentysix"]: A104059str := "twenty": lettonum := proc (let) if let = " " then return 0: end if: return convert(let, bytes)[1]-96: end proc: printf("20, "): for n from 2 to nlim do t := lettonum(A104059str[n]): A104059str := cat(A104059str, " ", words[t+1]): printf("%d, ", t): end do: # Nathaniel Johnston, Oct 28 2013
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,easy,nonn,word
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|