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

0, -1, -7, -32, 0, -15625, 243860689, 59468035633789920, 3536447262141707692104062559388672, 12506459237909580203511583184455022770672120296396568887010875139183

Offset: 0

Author

Arkadiusz Wesolowski, Aug 01 2011

Keywords

• easy
• sign

Comments

Example of a recursive sequence which produces a table containing two zeros.

Examples

			a(2) = -7 because a(1) = -1 and (-1)^2 - 2^(2+1) = -7.
		

Links

• Vincenzo Librandi, Table of n, a(n) for n = 0..12
• Eric Weisstein's World of Mathematics, Recursive Sequence

Crossrefs

Cf. A003095, A007778.

Programs

Mathematica

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

PARI

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

Formula

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