login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A155731
a(n) = a(n-1)^n + n; a(1)=1.
0
1, 3, 30, 810004, 348687049529230979905036801029
OFFSET
1,2
COMMENTS
a(6) has 178 digits and is too large to include. The parity of these numbers follow the pattern: odd, odd, even, even, odd, odd,... That is, a(n) modulo 2 gives the A133872 sequence.
FORMULA
a(n) = a(n-1)^n + n.
EXAMPLE
a(3) = a(2)^3+3 = 3^3+3 = 30.
CROSSREFS
Sequence in context: A375530 A308383 A065594 * A145385 A059232 A068698
KEYWORD
nonn
AUTHOR
Avik Roy (avik_3.1416(AT)yahoo.co.in), Jan 26 2009
STATUS
approved