|
| |
|
|
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; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
LINKS
| Index entries for sequences of form a(n+1)=a(n)^2 + ...
|
|
|
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] (* From 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: A019038 A198089 A197974 * A027303 A052695 A184360
Adjacent sequences: A114790 A114791 A114792 * A114794 A114795 A114796
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Stephen T. Rowe (EbolaPox(AT)gmail.com), Feb 18 2006
|
| |
|
|