login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066091 a(n+2) = a(n+1)*a(n)*(a(n+1)+a(n)). 2

%I

%S 1,2,6,96,58752,331914018816,6472527787868799987640958976,

%T 13905078437588927055776809046479521344793888146925785597768443625472

%N a(n+2) = a(n+1)*a(n)*(a(n+1)+a(n)).

%C The next term has 163 digits. - _Harvey P. Dale_, Dec 09 2017

%H Harry J. Smith, <a href="/A066091/b066091.txt">Table of n, a(n) for n = 0..10</a>

%t nxt[{a_,b_}]:={b,a*b*(a+b)}; NestList[nxt,{1,2},10][[All,1]] (* _Harvey P. Dale_, Dec 09 2017 *)

%o (PARI) { for (n=0, 10, if (n>1, a=a1*a2*(a1+a2); a2=a1; a1=a, if (n, a=a1=2, a=a2=1)); write("b066091.txt", n, " ", a) ) } \\ _Harry J. Smith_, Nov 12 2009

%K nonn

%O 0,2

%A _Benoit Cloitre_, Dec 30 2001

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 26 05:00 EDT 2020. Contains 337346 sequences. (Running on oeis4.)