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

%I #8 Oct 29 2012 14:25:36

%S 1,1,1,2,3,10,1002,1020180963368077455371525121027

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

%C a(8) has over 30000 digits.

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

%t t = {1, 1, 1}; Do[AppendTo[t, t[[-1]]^t[[-2]] + t[[-3]]], {5}]; t (* _T. D. Noe_, Oct 29 2012 *)

%Y Cf. A184163, A218270, A218122.

%K nonn

%O 0,4

%A _Nico Brown_, Oct 24 2012

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 25 12:15 EDT 2024. Contains 371969 sequences. (Running on oeis4.)