A194009 - cp's OEIS frontend

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

n	a(n)
0	2
1	3
2	5
3	4
4	7
5	13
6	5
7	9
8	17
9	28
10	6
11	11
12	21
13	35
14	58
15	7
16	13
17	25
18	42
19	70
20	114
21	8
22	15
23	29
24	49
25	82
26	134
27	218
28	9
29	17
30	33
31	56
32	94
33	154
34	251
35	407
36	10
37	19
38	37
39	63
40	106
41	174
42	284
43	461
44	747
45	11
46	21
47	41
48	70
49	118
50	194
51	317
52	515
53	835
54	1352
55	12
56	23
57	45
58	77
59	130
60	214
61	350
62	569

[2, 3, 5, 4, 7, 13, 5, 9, 17, 28, 6, 11, 21, 35, 58, 7, 13, 25, 42, 70, 114, 8, 15, 29, 49, 82, 134, 218, 9, 17, 33, 56, 94, 154, 251, 407, 10, 19, 37, 63, 106, 174, 284, 461, 747, 11, 21, 41, 70, 118, 194, 317, 515, 835, 1352, 12, 23, 45, 77, 130, 214, 350, 569]

cp's OEIS Frontend

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

Table of values

List of values

cp's OEIS Frontend

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

Table of values

List of values

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