|
|
A135997
|
|
Table of triples T(k,m) = k (m=1), 2-k (m=2) and 1-k (m=3).
|
|
2
|
|
|
0, 2, 1, 1, 1, 0, 2, 0, -1, 3, -1, -2, 4, -2, -3, 5, -3, -4, 6, -4, -5, 7, -5, -6, 8, -6, -7, 9, -7, -8, 10, -8, -9, 11, -9, -10, 12, -10, -11, 13, -11, -12, 14, -12, -13, 15, -13, -14, 16, -14, -15, 17, -15, -16, 18, -16, -17, 19, -17, -18, 20, -18, -19, 21, -19, -20, 22, -20, -21, 23
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
The table comprises recurrence coefficients for Fibonacci-related sequences b_k(n) = Sum_{m=1..3} T(k,m)*b_k(n-m). The first row coefficients (0,2,1) are used in A008346, b(n)=2b(n-2)+b(n-3), for example. The 2nd row coefficients (1,1,0) represent b(n)=b(n-1)+b(n-2) of A000045, for example.
|
|
LINKS
|
|
|
FORMULA
|
Row sums: Sum_{m=1..3} T(k,m) = A022959(k).
a(n) = (3*n-12+12*cos(2*n*Pi/3)-2*sqrt(3)*sin(2*n*Pi/3))*(-1)^sign(n mod 3))/9. - Wesley Ivan Hurt, Oct 01 2017
|
|
EXAMPLE
|
The table has 3 columns and starts:
0, 2, 1;
1, 1, 0;
2, 0,-1;
3,-1,-2;
|
|
MATHEMATICA
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign,tabf,less,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|