login
This site is supported by donations 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; internal format)
OFFSET

0,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: A203520 A115040 A065594 * A145385 A059232 A068698

Adjacent sequences:  A155728 A155729 A155730 * A155732 A155733 A155734

KEYWORD

nonn

AUTHOR

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 18 00:14 EST 2012. Contains 206085 sequences.