A135408 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A135408

a(1)=1. a(n) = a(n-1) + a(n-1)^a(n-1).

%I #14 Jun 28 2021 18:48:13

%S 1,2,6,46662

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

%C Next term is too large to include.

%C The next term has 217864 digits. - _Harvey P. Dale_, Jun 28 2021

%t FoldList[#2 + #1^#1 &, 1, {1, 2, 6}] (* _G. C. Greubel_, Oct 12 2016 *)

%t NestList[#+#^#&,1,4] (* _Harvey P. Dale_, Jun 28 2021 *)

%K nonn

%O 1,2

%A _Leroy Quet_, Dec 10 2007