cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A100704 a(n) = (a(n-1) + a(n-2)) * a(n-1) * a(n-2) with a(0)=1 and a(1)=1.

This page as a plain text file.
%I A100704 #11 Jun 02 2025 00:26:26
%S A100704 1,1,2,6,96,58752,331914018816,6472527787868799987640958976,
%T A100704 13905078437588927055776809046479521344793888146925785597768443625472
%N A100704 a(n) = (a(n-1) + a(n-2)) * a(n-1) * a(n-2) with a(0)=1 and a(1)=1.
%C A100704 The next term is too large to include.
%C A100704 Essentially the same as A066091. - _R. J. Mathar_, Sep 02 2008
%e A100704 (1 + 1) * 1*1 = 2.
%e A100704 (1 + 2) * 1*2 = 6.
%p A100704 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 A100704 Cf. A063896.
%K A100704 nonn
%O A100704 0,3
%A A100704 _Parthasarathy Nambi_, Dec 09 2004
%E A100704 More terms from _Emeric Deutsch_, Dec 23 2004