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.

A116944 a(1) = 1; for n>1, a(n) = (a(n-1)+1)^n.

Original entry on oeis.org

1, 4, 125, 252047376, 1017210679182495207444253709079169646680657
Offset: 1

Views

Author

Vim Wenders, Apr 18 2008

Keywords

Comments

There was a conjecture that this recurrence would produce the sequence A068894, but this is not the case.
a(6) has 253 digits. - Harvey P. Dale, Jan 17 2012

Programs

  • Mathematica
    RecurrenceTable[{a[1]==1,a[n]==(a[n-1]+1)^n},a,{n,6}] (* Harvey P. Dale, Jan 17 2012 *)