A193908 - cp's OEIS frontend

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)=2xq(n-1,x)+1 with q(0,x)=1.

n	a(n)
0	1
1	2
2	1
3	8
4	6
5	3
6	24
7	20
8	12
9	6
10	80
11	64
12	40
13	22
14	11
15	256
16	208
17	128
18	72
19	38
20	19
21	832
22	672
23	416
24	232
25	124
26	64
27	32
28	2688
29	2176
30	1344
31	752
32	400
33	208
34	106
35	53
36	8704
37	7040
38	4352
39	2432
40	1296
41	672
42	344
43	174
44	87
45	28160
46	22784
47	14080
48	7872
49	4192
50	2176
51	1112
52	564

[1, 2, 1, 8, 6, 3, 24, 20, 12, 6, 80, 64, 40, 22, 11, 256, 208, 128, 72, 38, 19, 832, 672, 416, 232, 124, 64, 32, 2688, 2176, 1344, 752, 400, 208, 106, 53, 8704, 7040, 4352, 2432, 1296, 672, 344, 174, 87, 28160, 22784, 14080, 7872, 4192, 2176, 1112, 564]

cp's OEIS Frontend

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)=2xq(n-1,x)+1 with q(0,x)=1.

Table of values

List of values

cp's OEIS Frontend

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.

Table of values

List of values

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)=2xq(n-1,x)+1 with q(0,x)=1.