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 A104057 #4 Mar 31 2012 13:48:38
%S A104057 20,23,15,0,26,5,18,15,0,20,23,15,0,20,8,18,5,5,0,15,14,5,0,6,9,22,5,
%T A104057 0,26,5,18,15,0,20,23,15,0,19,9,24,0,6,9,22,5,0,15,14,5,0,5,9,7,8,20,
%U A104057 0,15,14,5,0,6,9,22,5,0,26,5,18,15,0,20,23,15,0,26,5,18,15,0,20,23,15,0,20,8
%N A104057 Each number is the rank in the alphabet of a letter (and "0" stands for a space). After substitution one reads (in English): "two zero two three one five zero two six five one eight one five zero ..." which is the succession of the digits of the sequence itself: 2 0 2 3 1 5 0 2 6 5 1 8 1 5 0.
%C A104057 The only other such sequence starts with: 15 14 5 0 6 9 22 5 0... (which reads "one five...")
%o A104057 Contribution from _M. F. Hasler_, Aug 18 2010: (Start)
%o A104057 (PARI) /* helper function */
%o A104057 digit2seq(d) = { concat( apply( x->bitand(x,-97), Vec( Vecsmall( Str( [zero,one,two,three,four,five,six,seven,eight,nine][d+1])))),0) }
%o A104057 /* compute this sequence to at least Nmin terms. */
%o A104057 A104057(Nmin,a=[],pos=1)={ while( Nmin > #a=concat( a, concat( apply( digit2seq, eval( Vec( Str( if( #a, a[pos++ ], 20) )))))),);a}
%o A104057 (End)
%Y A104057 Cf. A169979, A104056, A104059.
%K A104057 base,easy,nonn,word
%O A104057 1,1
%A A104057 _Eric Angelini_, Mar 02 2005
%E A104057 Corrected a(52) from 6 to 9, and extended beyond a(69) by _M. F. Hasler_, Aug 18 2010