Triangular array: the fusion of (p(n,x)) by (q(n,x)), where p(n,x)=sum{(k+1)(n+1)*x^(n-k) : 0<=k<=n} and q(n,x)=sum{F(k+1)*x^(n-k) : 0<=k<=n}, where F=A000045 (Fibonacci numbers).
A193951
Triangular array: the fusion of (p(n,x)) by (q(n,x)), where p(n,x)=sum{(k+1)(n+1)*x^(n-k) : 0<=k<=n} and q(n,x)=sum{F(k+1)*x^(n-k) : 0<=k<=n}, where F=A000045 (Fibonacci numbers).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =4a(4) =6a(5) =10a(6) =9a(7) =15a(8) =27a(9) =42a(10) =16a(11) =28a(12) =52a(13) =84a(14) =136a(15) =25a(16) =45a(17) =85a(18) =140a(19) =230a(20) =370a(21) =36a(22) =66a(23) =126a(24) =210a(25) =348a(26) =564a(27) =912a(28) =49a(29) =91
External references
- oeis: A193951