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!)
A116944 a(1) = 1; for n>1, a(n)=(a(n-1)+1)^n. 0

%I #7 Nov 21 2013 12:48:56

%S 1,4,125,252047376,1017210679182495207444253709079169646680657

%N a(1) = 1; for n>1, a(n)=(a(n-1)+1)^n.

%C There was a conjecture that this recurrence would produce the sequence A068894, but this is not the case.

%C The next term -- a(6) -- has 253 digits. [From Harvey P. Dale, Jan 17 2012]

%t RecurrenceTable[{a[1]==1,a[n]==(a[n-1]+1)^n},a,{n,6}] (* _Harvey P. Dale_, Jan 17 2012 *)

%K nonn

%O 1,2

%A _Vim Wenders_, Apr 18 2008

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 March 28 16:34 EDT 2024. Contains 371254 sequences. (Running on oeis4.)