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.

A059232 a(1)= 1, a(n) = (a(n-1)^a(n-1)) + n.

Original entry on oeis.org

1, 3, 30, 205891132094649000000000000000000000000000004
Offset: 1

Views

Author

Fabian Rothelius, Jan 20 2001

Keywords

Comments

The next term is too large to include.

Examples

			a(2) = 1^1 + 2 = 3.
a(3) = 3^3 + 3 = 27 + 3 = 30.
		

Programs

  • Mathematica
    RecurrenceTable[{a[1]==1,a[n]==a[n-1]^a[n-1]+n},a,{n,4}] (* Harvey P. Dale, Dec 27 2012 *)
  • PARI
    { for (n = 1, 4, a=if (n==1, 1, a^a + n); write("b059232.txt", n, " ", a); ) } \\ Harry J. Smith, Jun 25 2009