login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A155731 a(n) = a(n-1)^n + n; a(1)=1. 0
1, 3, 30, 810004, 348687049529230979905036801029 (list; graph; refs; listen; history; text; internal format)
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
Sequence in context: A296407 A308383 A065594 * A145385 A059232 A068698
KEYWORD
nonn
AUTHOR
Avik Roy (avik_3.1416(AT)yahoo.co.in), Jan 26 2009
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)