A111115 First differences of A051484, namely A111104, that are greater than any previous difference.

2, 4, 6, 18, 48, 66, 150, 204, 318, 348, 450, 486, 546, 696, 1050

Offset: 1

Author

Walter Kehowski, Oct 15 2005

Keywords

• nonn

Comments

The sequence is unbounded and all terms from the third onward are 0 modulo 6.

Crossrefs

Cf. A051484, A111104.

Programs

Maple

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)]);

Formula

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.