The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A143684 a(0) = a(1) = 0; thereafter a(n) = 2*a(n-1)*a(n-2) + 1. 2
 0, 0, 1, 1, 3, 7, 43, 603, 51859, 62541955, 6486726488691, 811385112306041061811, 10526466601050236861337066646958803, 17082036570557873538131893815781561362696563088187144467, 359626974875792367278553795120318710475396935851854517275793126801351587742904492716786003 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..19 A. V. Aho and N. J. A. Sloane, Some doubly exponential sequences, Fibonacci Quarterly, Vol. 11, No. 4 (1973), pp. 429-437, alternative link. FORMULA Equals A142471/2. a(n) is about 1/2*c^(phi^n), where c = 1.27817816239858832577... and phi is the golden ratio. - Charles R Greathouse IV, Mar 21 2012, corrected by Vaclav Kotesovec, May 05 2015 MATHEMATICA a[n_]:=a[n]=If[n<2, 0, 2*a[n-1]*a[n-2]+1]; Table[a[n], {n, 0, 15}] (* G. C. Greubel, May 29 2021 *) PROG (MAGMA) I:=[0, 0]; [n le 2 select I[n] else 2*Self(n-1)*Self(n-2)+1: n in [1..15]]; // Vincenzo Librandi, Nov 14 2011 (Sage) def a(n): return 0 if (n<2) else 2*a(n-1)*a(n-2) + 1 [a(n) for n in (0..10)] # G. C. Greubel, May 29 2021 CROSSREFS Cf. A000058, A007660, A142471. Sequence in context: A019026 A181729 A162455 * A156893 A050639 A280717 Adjacent sequences:  A143681 A143682 A143683 * A143685 A143686 A143687 KEYWORD nonn AUTHOR N. J. A. Sloane, based on email from Carla J. Garner-Bennett, Nov 13 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 27 21:14 EDT 2022. Contains 354110 sequences. (Running on oeis4.)