A193915 - cp's OEIS frontend

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

n	a(n)
0	1
1	2
2	1
3	4
4	4
5	2
6	16
7	12
8	8
9	4
10	48
11	40
12	24
13	14
14	7
15	160
16	128
17	80
18	44
19	24
20	12
21	512
22	416
23	256
24	144
25	76
26	40
27	20
28	1664
29	1344
30	832
31	464
32	248
33	128
34	66
35	33
36	5376
37	4352
38	2688
39	1504
40	800
41	416
42	212
43	108
44	54
45	17408
46	14080
47	8704
48	4864
49	2592
50	1344
51	688
52	348
53	176
54	88

[1, 2, 1, 4, 4, 2, 16, 12, 8, 4, 48, 40, 24, 14, 7, 160, 128, 80, 44, 24, 12, 512, 416, 256, 144, 76, 40, 20, 1664, 1344, 832, 464, 248, 128, 66, 33, 5376, 4352, 2688, 1504, 800, 416, 212, 108, 54, 17408, 14080, 8704, 4864, 2592, 1344, 688, 348, 176, 88]

cp's OEIS Frontend

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

Table of values

List of values

cp's OEIS Frontend

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

Table of values

List of values

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