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
-1, 0, 1, 0, 1, 2, 3, 8, 25, 116, 1253, 30334, 3161239, 2890534072, 37908199848897, 39946852159641845000, 25587984997105954864555102857, 56071032677809871004962669691748664133130 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
David Rock, Problem of the Week.
EXAMPLE
a(5) = a(2)^3 + a(3)^2 + a(4) = 0^3 + 1^2 + 0 = 1.
a(9) = a(6)^3 + a(7)^2 + a(7) = 2^3 + 3^2 + 8 = 8 + 9 + 8 = 25.
MATHEMATICA
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]
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 *)
CROSSREFS
Sequence in context: A176962 A065619 A243963 * A358280 A343438 A107704
KEYWORD
sign
AUTHOR
Hamilton L. Hardison (HamiltonHardison(AT)gmail.com), Oct 15 2005
EXTENSIONS
More terms from Robert G. Wilson v, Oct 17 2005
STATUS
approved

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 March 19 06:50 EDT 2024. Contains 370953 sequences. (Running on oeis4.)