login
This site is supported by donations 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. 0
-1, 0, 1, 0, 1, 2, 3, 8, 25, 116, 1253, 30334, 3161239, 2890534072, 37908199848897, 39946852159641845000, 25587984997105954864555102857, 56071032677809871004962669691748664133130 (list; graph; refs; listen; history; 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]

CROSSREFS

Sequence in context: A171199 A176962 A065619 * A107704 A041399 A183948

Adjacent sequences:  A111118 A111119 A111120 * A111122 A111123 A111124

KEYWORD

sign

AUTHOR

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

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(at)rgwv.com), Oct 17 2005

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

Content is available under The OEIS End-User License Agreement .

Last modified February 16 13:41 EST 2012. Contains 205912 sequences.