Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111121
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
-1, 0, 1, 0, 1, 2, 3, 8, 25, 116, 1253, 30334, 3161239, 2890534072, 37908199848897, 39946852159641845000, 25587984997105954864555102857, 56071032677809871004962669691748664133130 (list; graph; listen)
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: A127905 A009224 A065619 this_sequence A107704 A041399 A041503

Adjacent sequences: A111118 A111119 A111120 this_sequence 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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research