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

%I

%S 1,1,2,5,33,1214,1509733,2281082919633,5203342727366374356990526,

%T 27074775538448408469117040958804384971249439965813,

%U 733043470457364306745565389055274337169526356099299839341244874661931850021760795731279812250002545

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

%H <a href="/index/Aa#AHSL">Index entries for sequences of form a(n+1)=a(n)^2 + ...</a>

%F a(n) ~ c^(2^n), where c = 1.117568080436159210016482629050645172893788101196409851633874670767953... . - _Vaclav Kotesovec_, Dec 18 2014

%e a(4) = sum of the cube of a(2) plus the square of a(3) = cube of 1 + the square of 2, resulting in 1 + 4 = 5. The next term is a(3)^3 + a(4)^2 = (2^3) + 5^2 = 33 = a(5).

%t Nest[Append[#,Last[#]^2+#[[-2]]^3]&,{1,1},10] (* _Harvey P. Dale_, Apr 17 2011 *)

%t nxt[{a_,b_}]:={b,a^3+b^2}; NestList[nxt,{1,1},10][[All,1]] (* _Harvey P. Dale_, Dec 04 2018 *)

%o (Python)

%o a,b = 0,1

%o for k in range(8):

%o print(b, end=", ")

%o a,b = b, a*a*a + b*b

%K nonn

%O 1,3

%A Stephen T. Rowe (EbolaPox(AT)gmail.com), Feb 18 2006

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 October 1 22:45 EDT 2022. Contains 357173 sequences. (Running on oeis4.)