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!)
A175980 a(1) = 1, for n >= 2: a(n) = a(n-1)^n + 1. 1

%I #4 Nov 02 2019 14:59:57

%S 1,2,9,6562,12166933384727052833

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

%C a(6) has 115 digits.

%e For n = 4: a(4) = 9^4 + 1 = 6562.

%t RecurrenceTable[{a[1]==1,a[n]==a[n-1]^n+1},a,{n,6}] (* _Harvey P. Dale_, Nov 02 2019 *)

%K nonn

%O 1,2

%A _Jaroslav Krizek_, Nov 03 2010

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 September 15 18:02 EDT 2024. Contains 375954 sequences. (Running on oeis4.)