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

%I #15 Jul 04 2018 06:24:42

%S 1,3,30,205891132094649000000000000000000000000000004

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

%C The next term is too large to include.

%e a(2) = 1^1 + 2 = 3.

%e a(3) = 3^3 + 3 = 27 + 3 = 30.

%t RecurrenceTable[{a[1]==1,a[n]==a[n-1]^a[n-1]+n},a,{n,4}] (* _Harvey P. Dale_, Dec 27 2012 *)

%o (PARI) { for (n = 1, 4, a=if (n==1, 1, a^a + n); write("b059232.txt", n, " ", a); ) } \\ _Harry J. Smith_, Jun 25 2009

%K nonn

%O 1,2

%A _Fabian Rothelius_, Jan 20 2001

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 24 13:30 EDT 2024. Contains 371957 sequences. (Running on oeis4.)