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.

A067691 a(n) = (a(n-1) + 1)^(n-1) for n > 0, a(0) = 0.

Original entry on oeis.org

0, 1, 2, 9, 1000, 1004006004001, 1020191144865623440455270145683555422808365843606721760320032
Offset: 0

Views

Author

Reinhard Zumkeller, Feb 04 2002

Keywords

Comments

a(7) has 361 digits.

Examples

			Given a(3) = 9: a(4) = (a(4-1)+1)^(4-1) = (9+1)^3 = 1000.
		

Crossrefs

Cf. A004019.

Programs

  • PARI
    a(n) = if (n==0, 0, (a(n-1) + 1)^(n-1)); \\ Michel Marcus, Feb 05 2021