Triangular array: the fusion of (p(n,x)) by (q(n,x)), where p(n,x)=sum{((k+1)^2)*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) .
A193959
Triangular array: the fusion of (p(n,x)) by (q(n,x)), where p(n,x)=sum{((k+1)^2)*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) =4a(3) =5a(4) =9a(5) =9a(6) =13a(7) =23a(8) =36a(9) =16a(10) =25a(11) =45a(12) =71a(13) =116a(14) =25a(15) =41a(16) =75a(17) =120a(18) =196a(19) =316a(20) =36a(21) =61a(22) =113a(23) =183a(24) =300a(25) =484a(26) =784a(27) =49a(28) =85a(29) =159
External references
- oeis: A193959