|
|
A138110
|
|
Table T(d,n) read column by column: the n-th term in the sequence of the d-th differences of A138112, d=0..4.
|
|
2
|
|
|
0, 0, 0, 1, -1, 0, 0, 1, 0, -1, 0, 1, 1, -1, -1, 1, 2, 0, -2, -1, 3, 2, -2, -3, 0, 5, 0, -5, -3, 3, 5, -5, -8, 0, 8, 0, -13, -8, 8, 13, -13, -21, 0, 21, 13, -34, -21, 21, 34, 0, -55, 0, 55, 34, -34, -55, 55, 89, 0, -89, 0, 144, 89, -89, -144, 144, 233, 0, -233, -144, 377, 233, -233, -377, 0, 610, 0, -610, -377, 377
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,17
|
|
COMMENTS
|
Ignoring signs, the sequence contains A000045(2)=1 ten times and each of the following Fibonacci numbers A000045(i>2) four times.
|
|
LINKS
|
|
|
FORMULA
|
T(0,n)=A138112(n). T(d,n)= T(d-1,n+1)-T(d-1,n), d=1..4.
sum_(d=0..4) T(d,n)=0 (columns sum to zero).
|
|
EXAMPLE
|
All 5 rows of the table T(d,n) are:
.0,.0,.0,.1,.3,.5,.5,..0,-13,-34,-55,-55,...0,.144,...
.0,.0,.1,.2,.2,.0,-5,-13,-21,-21,..0,.55,.144,.233,...
.0,.1,.1,.0,-2,-5,-8,.-8,..0,.21,.55,.89,..89,...0,...
.1,.0,-1,-2,-3,-3,.0,..8,.21,.34,.34,..0,.-89,-233,...
-1,-1,-1,-1,.0,.3,.8,.13,.13,..0,-34,-89,-144,-144,...
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign,tabf,less
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|