A193925 a(n) = a(n-1)^2 - n^(n-2) + n.

0, 0, 1, 1, -11, 1, -1289, 1644721, 2705106905705, 7317603371292879756764065, 53547319099556919431874542743248407878119975324235

Offset: 0

Author

Arkadiusz Wesolowski, Aug 09 2011

Keywords

• easy
• sign

Comments

Example of a recursive sequence which produces a table containing three ones.

Examples

			a(4) = -11 because a(3) = 1 and 1^2 - 4^(4-2) + 4 = -11.
		

Links

• Arkadiusz Wesolowski, Table of n, a(n) for n = 0..14
• Eric Weisstein's World of Mathematics, Recursive Sequence

Crossrefs

Cf. A003095, A000272.

Programs

Mathematica

RecurrenceTable[{a[n] == a[n - 1]^2 - n^(n - 2) + n, a[0] == 0}, a, {n, 10}]

PARI

print1(a=0, ", "); for(n=1, 10, print1(a=a^2-n^(n-2)+n, ", "));

Formula

a(0) = 0, a(n) = a(n-1)^2 - n^(n-2) + n.