Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A155731
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A155731 a(n)=a(n-1)^n + n; a(1)=1 +0
1
1, 3, 30, 810004, 348687049529230979905036801029 (list; graph; listen)
OFFSET

0,2

COMMENT

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: A012008 A115040 A065594 this_sequence A145385 A059232 A068698

Adjacent sequences: A155728 A155729 A155730 this_sequence A155732 A155733 A155734

KEYWORD

nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research