A328082 Triangle read by rows: columns are Fibonacci numbers F_{2i+1} shifted downwards.

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, 4181, 1597, 610, 233, 89, 34, 13, 5, 2, 1, 10946, 4181, 1597, 610, 233, 89, 34, 13, 5, 2, 1

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

Cf. A000045.

Sequence in context: A126075 A134032 A137151 * A048494 A047848 A275431

Adjacent sequences: A328079 A328080 A328081 * A328083 A328084 A328085

Keyword

nonn,tabl

Author

N. J. A. Sloane, Oct 15 2019

Extensions

More terms from Rémy Sigrist, Jul 14 2020

Status

approved