This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 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
 1, 1, 2, 5, 33, 1214, 1509733, 2281082919633, 5203342727366374356990526, 27074775538448408469117040958804384971249439965813, 733043470457364306745565389055274337169526356099299839341244874661931850021760795731279812250002545 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS FORMULA a(n) ~ c^(2^n), where c = 1.117568080436159210016482629050645172893788101196409851633874670767953... . - Vaclav Kotesovec, Dec 18 2014 EXAMPLE 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). MATHEMATICA Nest[Append[#, Last[#]^2+#[[-2]]^3]&, {1, 1}, 10]  (* Harvey P. Dale, Apr 17 2011 *) PROG (Python) Note that N needs to be set. If you set N to 20 the sequence will generate 1, 1, 2, 5 and stop. Set N to 10000 and it goes up to 1214. .a, b = 0, 1 .while b < N: ... print b ... a, b = b, a*a*a + b*b CROSSREFS Sequence in context: A198089 A197974 A208985 * A254429 A027303 A052695 Adjacent sequences:  A114790 A114791 A114792 * A114794 A114795 A114796 KEYWORD nonn AUTHOR Stephen T. Rowe (EbolaPox(AT)gmail.com), Feb 18 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.