Triangular array: the fusion of (p(n,x)) by (q(n,x)), where p(n,x)=sum{F(k+2)*x^(n-k) : 0<=k<=n}, where F=A000045 (Fibonacci numbers), and q(n,x)=2x*q(n-1,x)+1 with q(0,x)=1.

A193908

Triangular array: the fusion of (p(n,x)) by (q(n,x)), where p(n,x)=sum{F(k+2)*x^(n-k) : 0<=k<=n}, where F=A000045 (Fibonacci numbers), and q(n,x)=2x*q(n-1,x)+1 with q(0,x)=1.

Terms

    a(0) =1a(1) =2a(2) =1a(3) =8a(4) =6a(5) =3a(6) =24a(7) =20a(8) =12a(9) =6a(10) =80a(11) =64a(12) =40a(13) =22a(14) =11a(15) =256a(16) =208a(17) =128a(18) =72a(19) =38a(20) =19a(21) =832a(22) =672a(23) =416a(24) =232a(25) =124a(26) =64a(27) =32a(28) =2688a(29) =2176

External references