|
Search: id:A166117
|
|
|
| A166117 |
|
a(1)=0, a(2)=1, a(3)=2 and a(n) = a(n-1) - 2a(n-2) + a(n-3). |
|
+0
1
|
|
| 0, 1, 2, 0, -3, -1, 5, 4, -7, -10, 8, 21, -5, -39, -8, 65, 42, -96, -115, 119, 253, -100, -487, -34, 840, 421, -1293, -1295, 1712, 3009, -1710, -6016, 413, 10735, 3893, -17164, -14215, 24006, 35272, -26955, -73493, 15689, 135720, 30849, -224902
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
FORMULA
|
Defined recursively by: a(1)=0, a(2)=1, a(3)=2 and a(n)= a(n-1)-2a(n-2) + a(n-3)
|
|
EXAMPLE
|
a(1)=0, a(2)=1, a(3)=2 , a(4) = 2-2(1)+0 = 0 , a(5)= 0-2(2)+ 1 = -3 , a(5) = -3 -2(0) + 2 = -1, a(6)= -1 -2(-3)+ 0 = 5
|
|
CROSSREFS
|
Cf. A000073 Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) with a(0)=a(1)=0, a(2)=1. A000213 Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) with a(0)=a(1)=a(2)=1. A001590 Tribonacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) with a(0)=0, a(1)=1, a(2)=0.
Sequence in context: A162170 A008798 A005290 this_sequence A078051 A006209 A130627
Adjacent sequences: A166114 A166115 A166116 this_sequence A166118 A166119 A166120
|
|
KEYWORD
|
sign
|
|
AUTHOR
|
Barry Wells (wells.barry(AT)gmail.com), Oct 06 2009
|
|
|
Search completed in 0.002 seconds
|
