A triangle of recursive Fibonacci Lah numbers: f(n) = Fibonacci(n)*f(n - 1), L(n, k) = binomial(n-1, k-1)*(f(n)/f(k)).

A137478

A triangle of recursive Fibonacci Lah numbers: f(n) = Fibonacci(n)*f(n - 1), L(n, k) = binomial(n-1, k-1)*(f(n)/f(k)).

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =4a(5) =1a(6) =6a(7) =18a(8) =9a(9) =1a(10) =30a(11) =120a(12) =90a(13) =20a(14) =1a(15) =240a(16) =1200a(17) =1200a(18) =400a(19) =40a(20) =1a(21) =3120a(22) =18720a(23) =23400a(24) =10400a(25) =1560a(26) =78a(27) =1a(28) =65520a(29) =458640

External references