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 A111115 #2 Mar 31 2012 14:39:48 %S A111115 2,4,6,18,48,66,150,204,318,348,450,486,546,696,1050 %N A111115 First differences of A051484, namely A111104, that are greater than any previous difference. %C A111115 The sequence is unbounded and all terms from the third onward are 0 modulo 6. %F A111115 a(1)=2, a(n)=A111104(j_n) where j_n is the first index such that A111104(j_n)>A111104(k) for all k<j_n. %p A111115 M:=[0,2]: isElement := proc(n) global M; local b, j, k; b:=true; for j from 1 to nops(M)-1 do for k from j+1 to nops(M) do if M[j] = n mod M[k] then b:=false; break; fi od od; return b end: for z to 1 do for n from 3 while M[ -1]-M[ -2]<1000 do if isElement(n) then M:=[op(M),n] fi od od; M; SDM:=[]: sdmax:=0: for z to 1 do for k from 1 to nops(M)-1 do sd:=M[k+1]-M[k]; if sd>sdmax then sdmax:=sd; SDM:=[op(SDM),[k,M[k+1],sd]] fi od od; SDM; map(proc(z) SDM[z,3] end, [$1..nops(SDM)]); %Y A111115 Cf. A051484, A111104. %K A111115 nonn %O A111115 1,1 %A A111115 _Walter Kehowski_, Oct 15 2005