|
|
A173284
|
|
Triangle by columns, Fibonacci numbers in every column shifted down twice, for k > 0.
|
|
5
|
|
|
1, 1, 2, 1, 3, 1, 5, 2, 1, 8, 3, 1, 13, 5, 2, 21, 8, 3, 1, 34, 13, 5, 2, 1, 55, 21, 8, 3, 1, 89, 34, 13, 5, 2, 1, 144, 55, 21, 8, 3, 1, 233, 89, 34, 13, 5, 2, 1, 377, 144, 55, 21, 8, 3, 1, 610, 233, 89, 34, 13, 5, 2, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Let the triangle = M. Then lim_{n->infinity} M^n = A173285 as a left-shifted vector.
A173284 * [1, 2, 3, ...] = A054451: (1, 1, 4, 5, 12, 17, 33, ...). - Gary W. Adamson, Mar 03 2010
Triangle read by rows formed from antidiagonals of triangle A104762.
The diagonal sums lead to A004695. (end)
|
|
LINKS
|
|
|
FORMULA
|
Triangle by columns, Fibonacci numbers in every column shifted down twice, for k > 0.
T(n,k) = A000045(n-2*k+1), n >= 0 and 0 <= k <= floor(n/2).
|
|
EXAMPLE
|
First few rows of the triangle:
1;
1;
2, 1;
3, 1;
5, 2, 1;
8, 3, 1;
13, 5, 2, 1;
21, 8, 3, 1;
34, 13, 5, 2, 1;
55, 21, 8, 3, 1;
89, 34, 13, 5, 2, 1;
144, 55, 21, 8, 3, 1;
233, 89, 34, 13, 5, 2, 1;
377, 144, 55, 21, 8, 3, 1;
610, 233, 89, 34, 13, 5, 2, 1;
...
|
|
MAPLE
|
T := proc(n, k): if n<0 then return(0) elif k < 0 or k > floor(n/2) then return(0) else combinat[fibonacci](n-2*k+1) fi: end: seq(seq(T(n, k), k=0..floor(n/2)), n=0..14); # Johannes W. Meijer, Sep 05 2013
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|