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,1

Comments

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

Links

Table of n, a(n) for n=1..15.

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<j_n.

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

Crossrefs

Cf. A051484, A111104.

Sequence in context: A085146 A066894 A233919 * A195328 A294447 A143085

Adjacent sequences: A111112 A111113 A111114 * A111116 A111117 A111118

Keyword

nonn

Author

Walter Kehowski, Oct 15 2005

Status

approved