A155733 a(n) = a(n-1)^n+n-1; a(1)=1.

1, 2, 10, 10003, 100150090027004050247

Offset

1,2

Comments

a(6) has 121 digits. a(n) modulo 2 gives the pattern 1,0,0,1,1,0,0,1,1...

Links

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

Formula

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

Example

a(4) = a(3)^4+3 = 10^4+3 = 10003.

Mathematica

RecurrenceTable[{a[1]==1, a[n]==a[n-1]^n+n-1}, a[n], {n, 6}] (* Harvey P. Dale, Oct 17 2011 *)

Crossrefs

Sequence in context: A328157 A013557 A007158 * A080485 A125149 A079180

Adjacent sequences: A155730 A155731 A155732 * A155734 A155735 A155736

Keyword

nonn

Author

Avik Roy (avik_3.1416(AT)yahoo.co.in), Jan 26 2009

Status

approved