Triangular array T(n,k) = Fibonacci(n+1-k)*C(n,k), 0 <= k <= n.
A094441
Triangular array T(n,k) = Fibonacci(n+1-k)*C(n,k), 0 <= k <= n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =2a(5) =1a(6) =3a(7) =6a(8) =3a(9) =1a(10) =5a(11) =12a(12) =12a(13) =4a(14) =1a(15) =8a(16) =25a(17) =30a(18) =20a(19) =5a(20) =1a(21) =13a(22) =48a(23) =75a(24) =60a(25) =30a(26) =6a(27) =1a(28) =21a(29) =91
External references
- oeis: A094441