|
|
A155731
|
|
a(n) = a(n-1)^n + n; a(1)=1.
|
|
0
|
|
|
|
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.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = a(n-1)^n + n.
|
|
EXAMPLE
|
a(3) = a(2)^3+3 = 3^3+3 = 30.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Avik Roy (avik_3.1416(AT)yahoo.co.in), Jan 26 2009
|
|
STATUS
|
approved
|
|
|
|