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

%I #8 Jun 09 2023 21:40:01

%S -1,0,1,0,1,2,3,8,25,116,1253,30334,3161239,2890534072,37908199848897,

%T 39946852159641845000,25587984997105954864555102857,

%U 56071032677809871004962669691748664133130

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

%H Harvey P. Dale, <a href="/A111121/b111121.txt">Table of n, a(n) for n = 1..26</a>

%H David Rock, <a href="http://www.olemiss.edu/mathed/pow/november.html">Problem of the Week</a>.

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

%e a(9) = a(6)^3 + a(7)^2 + a(7) = 2^3 + 3^2 + 8 = 8 + 9 + 8 = 25.

%t a[1] = -1; a[2] = 0; a[3] = 1; a[n_] := a[n] = a[n - 3]^3 + a[n - 2]^2 + a[n - 1]; a /@ Range[20]

%t nxt[{a_,b_,c_}]:={b,c,a^3+b^2+c}; NestList[nxt,{-1,0,1},20][[All,1]] (* _Harvey P. Dale_, Nov 14 2022 *)

%K sign

%O 1,6

%A Hamilton L. Hardison (HamiltonHardison(AT)gmail.com), Oct 15 2005

%E More terms from _Robert G. Wilson v_, Oct 17 2005

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 23 06:04 EDT 2024. Contains 371906 sequences. (Running on oeis4.)