The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A100704 a(n) = (a(n-1) + a(n-2)) * a(n-1) * a(n-2) with a(0)=1 and a(1)=1 0

%I #9 Aug 17 2017 02:57:13

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

%T 13905078437588927055776809046479521344793888146925785597768443625472

%N a(n) = (a(n-1) + a(n-2)) * a(n-1) * a(n-2) with a(0)=1 and a(1)=1

%C The next term is too large to include.

%C Essentially the same as A066091. - _R. J. Mathar_, Sep 02 2008

%e (1 + 1) * 1*1 = 2.

%e (1 + 2) * 1*2 = 6.

%p a[0]:=1: a[1]:=1: for n from 2 to 9 do a[n]:= (a[n-1]+a[n-2])*a[n-1]*a[n-2] od: seq(a[n],n=0..9); # _Emeric Deutsch_, Dec 23 2004

%Y Cf. A063896.

%K nonn

%O 0,3

%A _Parthasarathy Nambi_, Dec 09 2004

%E More terms from _Emeric Deutsch_, Dec 23 2004

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 June 1 12:42 EDT 2024. Contains 373023 sequences. (Running on oeis4.)