This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A104059 #7 Oct 28 2013 11:12:41
%S A104059 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,
%T A104059 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,
%U A104059 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
%N 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).
%H A104059 Nathaniel Johnston, <a href="/A104059/b104059.txt">Table of n, a(n) for n = 1..10000</a>
%p A104059 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
%K A104059 base,easy,nonn,word
%O A104059 1,1
%A A104059 _Eric Angelini_, Mar 02 2005
%E A104059 a(27) and a(28) corrected by _J.J.J. Klein_, Oct 28 2013