cp's OEIS Frontend

A110407 Integers with mutual residues -2.

%I A110407 #20 Mar 05 2019 19:58:23
%S A110407 3,5,13,193,37633,1416317953,2005956546822746113,
%T A110407 4023861667741036022825635656102100993,
%U A110407 16191462721115671781777559070120513664958590125499158514329308740975788033
%N A110407 Integers with mutual residues -2.
%C A110407 This is the special case k=2 of sequences with mutual residues -k. In general, a(1)=k+1 and a(n)=min{m | m>a(n-1), mod(m,a(i))=-k, i=1,...,n-1}.
%C A110407 An infinite coprime sequence
%H A110407 S. Mustonen, <a href="http://www.survo.fi/papers/resseq.pdf">On integer sequences with mutual k-residues</a>
%F A110407 a(1)=3, a(2)=5, a(n)=-2+a(1)*a(2)*...*a(n-1) [typo corrected by _Vincenzo Librandi_, Feb 08 2010]
%F A110407 a(n)=a(n-1)^2+2*a(n-1)-2, for n>3.
%F A110407 Apparently a(n)=A003010(n-2)-1 for n>=3. - _R. J. Mathar_, Apr 22 2007
%p A110407 a:=proc(k,n::nonnegint) option remember; if n<3 then RETURN(n*k+1); fi; if n=3 then RETURN(a(k,1)*a(k,2)-k); fi; a(k,n-1)*(a(k,n-1)+k)-k; end; seq(a(2,n),n=1..9);
%t A110407 Join[{3,5},NestList[#^2+2#-2&,13,6]] (* _Harvey P. Dale_, Mar 05 2019 *)
%K A110407 nonn
%O A110407 1,1
%A A110407 _Seppo Mustonen_, Sep 11 2005