cp's OEIS Frontend

A002814 For n > 1: a(n) = a(n-1)^3 + 3a(n-1)^2 - 3; a(0) = 1, a(1) = 2.

%I A002814 M2105 N0833 #78 Dec 08 2022 12:39:14
%S A002814 1,2,17,5777,192900153617,7177905237579946589743592924684177
%N A002814 For n > 1: a(n) = a(n-1)^3 + 3a(n-1)^2 - 3; a(0) = 1, a(1) = 2.
%C A002814 An infinite coprime sequence defined by recursion. - _Michael Somos_, Mar 14 2004
%C A002814 Next terms have 102 and 305 digits. - _Harvey P. Dale_, Jun 06 2011
%C A002814 From _Peter Bala_, Nov 15 2012: (Start)
%C A002814 The present sequence is the case x = 3 of the following general remarks. The recurrence equation a(n+1) = a(n)^3 + 3*a(n)^2 - 3 with the initial condition a(1) = x - 1 > 1 has the explicit solution a(n+1) = alpha^(3^n) + (1/alpha)^(3^n) - 1 for n >= 0, where alpha := {x + sqrt(x^2 - 4)}/2.
%C A002814 Two other recurrences satisfied by the sequence are a(n+1) = (a(1) + 3)*(Product_{k = 1..n} a(k)^2) - 3 and a(n+1) = 1 + (a(1) - 1)*Product_{k = 1..n} (a(k) + 2)^2, both with a(1) = x - 1.
%C A002814 The associated sequence b(n) := a(n) + 1 satisfies the recurrence equation b(n+1) = b(n)^3 - 3*b(n) with the initial condition b(1) = x. See A001999 for the case x = 3. The sequence c(n) := a(n) + 2 satisfies the recurrence equation c(n+1) = c(n)^3 - 3*c(n)^2 + 3 with the initial condition c(1) = x + 1.
%C A002814 The sequences a(n) and b(n) have been considered by Fine and Escott in connection with a product expansion for quadratic irrationals. We have the following identity, valid for x > 2: sqrt((x + 2)/(x - 2)) = (1 + 2/(x-1))*sqrt((y + 2)/(y - 2)), where y = x^3 - 3*x or, equivalently, y - 1 = (x - 1)^3 + 3*(x - 1)^2 - 3. Iterating the identity produces the product expansion sqrt((x+2)/(x-2)) = Product_{n >= 1} (1 + 2/a(n)), with a(1) = x - 1 and a(n+1) = a(n)^3 + 3*a(n)^2 - 3.
%C A002814 For similar results to the above see A145502. See also A219162. (End)
%C A002814 Conjecture: The sequence {a(n) - 2: n >= 1} is a strong divisibility sequence, that is, gcd(a(n) - 2, a(m) - 2) = a(gcd(n, m)) - 2 for n, m >= 1. - _Peter Bala_, Dec 08 2022
%D A002814 L. E. Dickson, History of the Theory of Numbers. Carnegie Institute Public. 256, Washington, DC, Vol. 1, 1919; Vol. 2, 1920; Vol. 3, 1923, see vol. 1, p. 397.
%D A002814 E. Lucas, Nouveaux théorèmes d'arithmétique supérieure, Comptes Rend., 83 (1876), 1286-1288.
%D A002814 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D A002814 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A002814 Reinhard Zumkeller, <a href="/A002814/b002814.txt">Table of n, a(n) for n = 0..8</a>
%H A002814 E. B. Escott, <a href="https://www.jstor.org/stable/2301484">Rapid method for extracting a square root</a>, Amer. Math. Monthly, 44 (1937), 644-646.
%H A002814 N. J. Fine, <a href="https://www.jstor.org/stable/2321014">Infinite products for k-th roots</a>, Amer. Math. Monthly Vol. 84, No. 8, Oct. 1977.
%H A002814 E. Lucas, <a href="/A001566/a001566.pdf">Nouveaux théorèmes d'arithmétique supérieure</a> (annotated scanned copy)
%H A002814 M. Mendes France and A. J. van der Poorten, <a href="https://dx.doi.org/10.1016/0304-3975(89)90045-5">From geometry to Euler identities</a>, Theoret. Comput. Sci., 65 (1989), 213-220.
%H A002814 J. Shallit, <a href="http://archive.org/details/jresv80Bn2p285">Predictable regular continued cotangent expansions</a>, J. Res. Nat. Bur. Standards Sect. B 80B (1976), no. 2, 285-290.
%F A002814 a(n) = Fibonacci(3^n)/Fibonacci(3^(n-1)). - _Henry Bottomley_, Jul 10 2001
%F A002814 a(n+1) = 5*(f(n))^2 - 3, where f(n) = Fibonacci(3^n) = product of first n entries. - _Lekraj Beedassy_, Jun 16 2003
%F A002814 From _Artur Jasinski_, Oct 05 2008: (Start)
%F A002814 a(n+2) = (G^(3^(n + 1)) - (1 - G)^(3^(n + 1)))/((G^(3^n)) - (1 - G)^(3^n)) where G = (1 + sqrt(5))/2;
%F A002814 a(n+2) = A045529(n+1)/A045529(n). (End)
%F A002814 From _Peter Bala_, Nov 15 2012: (Start)
%F A002814 a(n+1) = (1/2*(3 + sqrt(5)))^(3^n) + (1/2*(3 - sqrt(5)))^(3^n) - 1.
%F A002814 The sequence b(n):= a(n) + 2 is a solution to the recurrence b(n+1) = b(n)^3 - 3*b(n)^2 + 3 with b(1) = 4.
%F A002814 Other recurrence equations:
%F A002814 a(n+1) = -3 + 5*(Product_{k = 1..n} a(k)^2) with a(1) = 2.
%F A002814 a(n+1) = 1 + Product_{k = 1..n} (a(k) + 2)^2 with a(1) = 2.
%F A002814 Thus Y := Product_{k = 1..n} a(k) and X := Product_{k = 1..n} (a(k) + 2) give a solution to the Diophantine equation X^2 - 5*Y^2 = -4.
%F A002814 sqrt(5) = Product_{n >= 1} (1 + 2/a(n)). The rate of convergence is cubic. Fine remarks that twelve factors of the product would give well over 300,000 correct decimal digits for sqrt(5).
%F A002814 5 - {Product_{n = 1..N} (1 + 2/a(n))}^2 = 20/(a(N+1) + 3). (End)
%F A002814 a(n) = 2*T(3^(n-1),3/2) - 1 for n >= 1, where T(n,x) denotes the n-th Chebyshev polynomial of the first kind. - _Peter Bala_, Dec 06 2022
%t A002814 Join[{1}, NestList[#^3+3#^2-3&,2,5]] (* _Harvey P. Dale_, Apr 01 2011 *)
%o A002814 (PARI) a(n)=if(n<2,max(0,n+1),a(n-1)^3+3*a(n-1)^2-3)
%o A002814 (Maxima) a[0]:1$ a[1]:2$ a[n]:=a[n-1]^3 + 3*a[n-1]^2-3$ A002814(n):=a[n]$
%o A002814 makelist(A002814(n),n,0,6); /* _Martin Ettl_, Nov 12 2012 */
%o A002814 (Haskell)
%o A002814 a002814 n = a002814_list !! n
%o A002814 a002814_list = 1 : zipWith div (tail xs) xs
%o A002814    where xs = map a000045 a000244_list
%o A002814 -- _Reinhard Zumkeller_, Nov 24 2012
%Y A002814 Cf. A000045, A001566.
%Y A002814 Cf. A045529. A001999, A145502, A219162.
%Y A002814 Cf. A000244.
%K A002814 nonn,easy,nice
%O A002814 0,2
%A A002814 _N. J. A. Sloane_
%E A002814 Definition improved by _Reinhard Zumkeller_, Feb 29 2012