A330581 a(0) = 2; thereafter a(n) = a(n - 1)^n + 1.

2, 3, 10, 1001, 1004006004002, 1020191144865623440455270145683555422808365843606721760320033

Offset

0,1

Comments

Note that this could be extended backwards to a(-1), and any nonzero value x for a(-1) would work, since x^0 + 1 = 2.

Links

Table of n, a(n) for n=0..5.

David Johnson-Davies, Recursive functions without a base case

Maple

a:= proc(n) option remember; `if`(n<0, %,
      1 + a(n-1)^n)
    end:
seq(a(n), n=0..5);  # Alois P. Heinz, Dec 18 2019

Mathematica

a[0] = 2; a[n_] := a[n] = a[n - 1]^n + 1; Array[a, 6, 0] (* Amiram Eldar, Dec 19 2019 *)
nxt[{n_, a_}]:={n+1, a^(n+1)+1}; NestList[nxt, {0, 2}, 5][[;; , 2]] (* Harvey P. Dale, Dec 10 2023 *)

Prog

(Lisp) (defun a (n) (+ (if (zerop n) 1 (expt (a (- n 1)) n)) 1))
(PARI) a(n) = if(n==0, 2, a(n-1)^n+1) \\ Felix Fröhlich, Dec 18 2019

Crossrefs

Cf. A000522, A182242.

Sequence in context: A290638 A330294 A270442 * A184163 A218271 A128125

Adjacent sequences: A330578 A330579 A330580 * A330582 A330583 A330584

Keyword

nonn

Author

David Johnson-Davies, Dec 18 2019

Extensions

Edited by N. J. A. Sloane, Dec 27 2019

Status

approved