OFFSET
1,2
COMMENTS
A Riordan array.
LINKS
Rémy Sigrist, Table of n, a(n) for n = 1..5050
Rigoberto Flórez, Leandro Junes, José L. Ramírez, Enumerating several aspects of non-decreasing Dyck paths, Discrete Mathematics (2019) Vol. 342, Issue 11, 3079-3097. See page 3083.
EXAMPLE
Triangle begins:
1;
2, 1;
5, 2, 1;
13, 5, 2, 1;
34, 13, 5, 2, 1;
89, 34, 13, 5, 2, 1;
233, 89, 34, 13, 5, 2, 1;
610, 233, 89, 34, 13, 5, 2, 1;
1597, 610, 233, 89, 34, 13, 5, 2, 1;
...
PROG
(PARI) T(n, k) = fibonacci(2*(n-k)+1) \\ Rémy Sigrist, Jul 14 2020
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
N. J. A. Sloane, Oct 15 2019
EXTENSIONS
More terms from Rémy Sigrist, Jul 14 2020
STATUS
approved