Triangular array: the fusion of (p(n,x)) by (q(n,x)), where p(n,x)=sum{F(k+1)*x^(n-k) : 0<=k<=n}, where F=A000045 (Fibonacci numbers), and q(n,x)=sum{((k+1)^2)*x^(n-k) : 0<=k<=n}.
A193955
Triangular array: the fusion of (p(n,x)) by (q(n,x)), where p(n,x)=sum{F(k+1)*x^(n-k) : 0<=k<=n}, where F=A000045 (Fibonacci numbers), and q(n,x)=sum{((k+1)^2)*x^(n-k) : 0<=k<=n}.
Terms
- a(0) =1a(1) =1a(2) =4a(3) =1a(4) =5a(5) =13a(6) =2a(7) =9a(8) =23a(9) =45a(10) =3a(11) =14a(12) =36a(13) =71a(14) =120a(15) =5a(16) =23a(17) =59a(18) =116a(19) =196a(20) =300a(21) =8a(22) =37a(23) =95a(24) =187a(25) =316a(26) =484a(27) =692a(28) =13a(29) =60
External references
- oeis: A193955