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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A177785 a(n) = a(n-1)^2 - a(n-2) for n > 2; a(1)=3, a(2)=0. 0

%I #16 Apr 07 2021 02:49:57

%S 3,0,-3,9,84,7047,49660125,2466128015008578,

%T 6081787386410149117225363921959,

%U 36988137813497592451208729538020214534589070415260614227389103

%N a(n) = a(n-1)^2 - a(n-2) for n > 2; a(1)=3, a(2)=0.

%C The Aho-Sloane paper describes how to analyze sequences of this type. - _N. J. A. Sloane_, Dec 02 2013

%H A. V. Aho and N. J. A. Sloane, <a href="https://www.fq.math.ca/Scanned/11-4/aho-a.pdf">Some doubly exponential sequences</a>, Fibonacci Quarterly, Vol. 11, No. 4 (1973), pp. 429-437, <a href="http://neilsloane.com/doc/doubly.html">alternative link</a>.

%F a(n) ~ c^(2^n), where c = 1.14848429555729513492678444046479599533741444456530988510700824973103959568... . - _Vaclav Kotesovec_, May 21 2015

%t RecurrenceTable[{a[1]==3,a[2]==0,a[n]==a[n-1]^2-a[n-2]},a,{n,10}] (* _Harvey P. Dale_, Jul 26 2014 *)

%K sign

%O 1,1

%A Liam Kirsh (liam.kirsh(AT)gmail.com), May 13 2010

%E Sequence was provided without a definition; definition inferred and terms a(7)-a(10) added by _Jon E. Schoenfield_, Dec 02 2013

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)