OFFSET
1,4
COMMENTS
LINKS
Elena Barcucci, Alberto del Lungo, S. Fezzi, and Renzo Pinzani, Nondecreasing Dyck paths and q-Fibonacci numbers, Discrete Math., 170, 1997, 211-217.
Emeric Deutsch and Helmut Prodinger, A bijection between directed column-convex polyominoes and ordered trees of height at most three, Theoretical Comp. Science, 307, 2003, 319-325.
Juan B. Gil, Felix H. Xu, and William Y. Zhu, Odd-indexed Fibonacci numbers via pattern-avoiding permutations, arXiv:2506.15800 [math.CO], 2025. See p. 4. See also Integers (2025) Vol. 25, Art. No. A79. See p. 5.
FORMULA
T(n, k) = k*fibonacci(2n-2k-1) if k<n; T(n, n) = 1.
G.f.: t*z*(1-2z-tz+3tz^2-tz^3)/((1-3z+z^2)*(1-tz)^2).
EXAMPLE
Triangle begins:
1;
1,1;
2,2,1;
5,4,3,1;
13,10,6,4,1;
MAPLE
with(combinat):T:=proc(n, k) if k<n then k*fibonacci(2*n-2*k-1) elif k=n then 1 else 0 fi end:for n from 1 to 12 do seq(T(n, k), k=1..n) od; # yields sequence in triangular form
MATHEMATICA
Flatten[Join[{1}, #]&/@Table[k*Fibonacci[2n-2k-1], {n, 15}, {k, n-1}]] (* Harvey P. Dale, Aug 21 2013 *)
CROSSREFS
KEYWORD
AUTHOR
Emeric Deutsch, Apr 25 2005
STATUS
approved
