%I M0740 N0278 #39 Jun 20 2017 12:27:00

%S 1,2,3,5,13,83,2503,976253,31601312113,2560404986164794683,

%T 202523113189037952478722304798003,

%U 506227391211661106785411233681995783881012463859772443053

%N a(0) = 1, a(1) = 2, a(2) = 3; for n >= 3, a(n) = a(n-2) + a(n-1)*Product_{i=1..n-3} a(i).

%C From a continued fraction.

%C Every term is relatively prime to all others. - _Michael Somos_, Feb 01 2004

%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H John Cerkan, <a href="/A001685/b001685.txt">Table of n, a(n) for n = 0..16</a>

%H V. C. Harris, <a href="http://www.jstor.org/stable/2309559">Another proof of the infinitude of primes</a>, Amer. Math. Monthly, 63 (1956), 711.

%H R. Mestrovic, <a href="http://arxiv.org/abs/1202.3670">Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 BC--2012) and another new proof</a>, arXiv preprint arXiv:1202.3670 [math.HO], 2012. - From _N. J. A. Sloane_, Jun 13 2012

%F a(n) = a(n-2) + a(n-1)*a(n-3)*(a(n-1)-a(n-3))/a(n-2). - _Vaclav Kotesovec_, May 21 2015

%F a(n) ~ c^(d^n), where d = A109134 = 1.754877666246692760049508896358528691894606617772793143989283970646... is the root of the equation d*(d-1)^2 = 1, c = 1.3081335128180696870655208993764956995000211962454918672885690026423582299... . - _Vaclav Kotesovec_, May 21 2015

%t Clear[a]; a[0]=1; a[1]=2; a[2]=3; a[n_]:=a[n] = a[n-2] + a[n-1]*Product[a[j],{j,1,n-3}]; Table[a[n],{n,0,15}] (* _Vaclav Kotesovec_, May 21 2015 *)

%t Clear[a];RecurrenceTable[{a[n]==a[n-2]+a[n-1]*a[n-3]*(a[n-1]-a[n-3])/a[n-2],a[0]==1,a[1]==2,a[2]==3},a,{n,0,15}] (* _Vaclav Kotesovec_, May 21 2015 *)

%o (PARI) a(n)=if(n<3,max(0,n+1),a(n-2)+a(n-1)*prod(i=1,n-3,a(i))) /* _Michael Somos_, Feb 01 2004 */

%Y Cf. A003686, A064526, A109134.

%K nonn

%O 0,2

%A _N. J. A. Sloane_

%E Edited by _N. J. A. Sloane_, Jun 12 2006