OFFSET
1,2
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..11325 (rows n = 1..150, flattened)
FORMULA
Counting the top row as the first row, the n-th row is
F(n+1)-F(0), F(n+1)-F(2), ..., F(n+1)-F(n-1), F(n+1)-F(n).
EXAMPLE
First rows:
1
2 1
3 2 1
5 4 3 2
8 7 6 5 3
13 12 11 10 8 5
...
MAPLE
F:= combinat[fibonacci]:
T:= (n, k)-> F(n+1)-`if`(k=1, 0, F(k)):
seq(seq(T(n, k), k=1..n), n=1..12); # Alois P. Heinz, Feb 06 2023
MATHEMATICA
Table[Fibonacci[n + 1] - If[k > 1, Fibonacci[k], 0], {n, 12}, {k, n}] // Flatten (* Michael De Vlieger, Feb 06 2023 *)
PROG
(PARI) row(n) = vector(n, k, fibonacci(n+1) - if (k>1, fibonacci(k), 0)); \\ Michel Marcus, Feb 06 2023
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Clark Kimberling, Dec 16 2009
STATUS
approved