|
|
A193588
|
|
A Fibonacci triangle: T(n,k) = Fib(k+2) for 0 <= k <= n.
|
|
2
|
|
|
1, 1, 2, 1, 2, 3, 1, 2, 3, 5, 1, 2, 3, 5, 8, 1, 2, 3, 5, 8, 13, 1, 2, 3, 5, 8, 13, 21, 1, 2, 3, 5, 8, 13, 21, 34, 1, 2, 3, 5, 8, 13, 21, 34, 55, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
n-th alternating row sum: A000045, F(n).
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
1;
1, 2;
1, 2, 3;
1, 2, 3, 5;
1, 2, 3, 5, 8;
|
|
MATHEMATICA
|
Table[Fibonacci[k+2], {n, 0, 20}, {k, 0, n}]//Flatten (* Harvey P. Dale, Nov 29 2017 *)
Module[{nn=15, fibs}, fibs=Fibonacci[Range[2, nn]]; Table[Take[fibs, n], {n, nn-1}]]// Flatten (* Harvey P. Dale, Mar 02 2023 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|