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.

Showing 1-1 of 1 results.

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

Original entry on oeis.org

1, 1, 2, 6, 96, 58752, 331914018816, 6472527787868799987640958976, 13905078437588927055776809046479521344793888146925785597768443625472
Offset: 0

Views

Author

Parthasarathy Nambi, Dec 09 2004

Keywords

Comments

The next term is too large to include.
Essentially the same as A066091. - R. J. Mathar, Sep 02 2008

Examples

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

Crossrefs

Cf. A063896.

Programs

  • Maple
    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

Extensions

More terms from Emeric Deutsch, Dec 23 2004
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.