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!)
A072291 a(n)=a(n-1)+a(n-2)^n with a(1)=a(2)=1. 0

%I #6 Nov 21 2013 12:47:49

%S 1,1,2,3,35,764,64339297639,116077185312567988110695,

%T 18892387313428899538307330663260392355466879654765476495891159778191517586427262736430696974019854

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

%C The next term -- a(10) -- has 231 digits. [From Harvey P. Dale, Aug 16 2011]

%e a(5)=35 because a(5)=a(4)+a(3)^5=3+2^5=35

%t RecurrenceTable[{a[1]==a[2]==1,a[n]==a[n-1]+a[n-2]^n},a[n],{n,10}] (* _Harvey P. Dale_, Aug 16 2011 *)

%o (BASIC) 30 A=1:B=1 35 print A:print B 40 for I=3 to 20 50 C=B+A^I 60 print C 70 A=B:B=C 80 next 90 end

%K nonn

%O 1,3

%A _Felice Russo_, Jul 12 2002

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 July 22 21:11 EDT 2024. Contains 374544 sequences. (Running on oeis4.)