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 A113538 #4 Sep 24 2011 11:21:31
%S A113538 3608528850368400786036725,45654723072420840000,3654081096960006804,
%T A113538 45088208494568,54648000,6327096165,7290842,81072,902468,30849008,
%U A113538 55258568,247808,658563,705672,304380098,6462,342006,7220,38016725,6094
%N A113538 This list of numbers a(i) has the property that every left-subset of length n > 0 of the numbers a(i) is divisible by i+n and are the largest such integers for every i.
%H A113538 P. J. Hendriks, <a href="http://home.planet.nl/~p.j.hendriks/p114.htm">Puzzle 114, Salami-numbers</a>
%H A113538 HP-museum mailing list, an algorithm for finding a(0): <a href="http://www.hpmuseum.org/cgi-sys/cgiwrap/hpmuseum/archv015.cgi?read=74181">HP71B algorithm</a>.
%o A113538 (PARI) issalami(p, order) = ok=1;count=truncate(log(p)/log(10)+1);ordlen=truncate(log(order)/log(10));for(i=1,count-ordlen,test=(truncate(p/10^(count-i-ordlen)+0.)/(i+order-1));if(test!=truncate(test+0.),ok=0));return(ok) findsalami(x, order) = for(i=0,9,if(issalami(x*10+i,order)==1,if(maxsalami<x*10+i,maxsalami=x*10+i);findsalami(x*10+i,order))) for(order=1,30,maxsalami=0;for(t=1,99,findsalami(t,order));print("Order "order":"maxsalami))
%K A113538 nonn
%O A113538 0,1
%A A113538 Christ van Willegen (cvwillegen(AT)gmail.com), Jan 13 2006