Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #23 Sep 08 2022 08:46:07
%S 2,5,9,89,8009,64152089,4115490587216009,
%T 16937262773463574696951813104089
%N a(0)=2, a(1)=5; thereafter a(n) = product of all preceding terms, minus 1.
%H Robert Munafo, <a href="http://mrob.com/pub/math/nu-sequences.html#table">Some integer sequences</a>
%H Robert Munafo, <a href="http://mrob.com/pub/seq/coprime.html">Mutually coprime sequences</a>
%F a(n) == 8 mod 9, for n > 2. - _Ivan N. Ianakiev_, Apr 06 2014
%F a(n) = (a(n-1)+1)*a(n-1)-1, for n > 2. - _Zak Seidov_, Apr 06 2014
%e (9 + 1)*9 - 1 = 89, (89 + 1)*89 - 1 = 8009, (8009 + 1)*8009 - 1 = 64152089. - _Zak Seidov_, Apr 06 2014
%o (Magma) I:=[2, 5, 9]; [n le 3 select I[n] else Self(n-1)*(Self(n-1)+1)-1: n in [1..10]]; // _Vincenzo Librandi_, May 22 2014
%Y Cf. A144779-A144784, A239900.
%K nonn
%O 0,1
%A _N. J. A. Sloane_, Apr 05 2014