A368155 - cp's OEIS frontend

A368155 Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3x, p(n,x) = up(n-1,x) + vp(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 3x - 2*x^2.

n	a(n)
1	1
2	1
3	3
4	2
5	3
6	7
7	3
8	9
9	5
10	15
11	5
12	15
13	26
14	3
15	31
16	8
17	30
18	43
19	63
20	-15
21	63
22	13
23	54
24	104
25	87
26	144
27	-81
28	127
29	21
30	99
31	203
32	273
33	115
34	333
35	-275
36	255
37	34
38	177
39	416
40	549
41	609
42	-9
43	806
44	-789
45	511
46	55
47	315
48	811
49	1263
50	1146
51	1260
52	-725
53	2043
54	-2071
55	1023
56	89
57	555
58	1573

[1, 1, 3, 2, 3, 7, 3, 9, 5, 15, 5, 15, 26, 3, 31, 8, 30, 43, 63, -15, 63, 13, 54, 104, 87, 144, -81, 127, 21, 99, 203, 273, 115, 333, -275, 255, 34, 177, 416, 549, 609, -9, 806, -789, 511, 55, 315, 811, 1263, 1146, 1260, -725, 2043, -2071, 1023, 89, 555, 1573]

cp's OEIS Frontend

A368155 Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3x, p(n,x) = up(n-1,x) + vp(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 3x - 2*x^2.

Table of values

List of values

cp's OEIS Frontend

A368155 Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3*x, p(n,x) = u*p(n-1,x) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 3*x - 2*x^2.

Table of values

List of values

A368155 Triangular array T(n,k), read by rows: coefficients of strong divisibility sequence of polynomials p(1,x) = 1, p(2,x) = 1 + 3x, p(n,x) = up(n-1,x) + vp(n-2,x) for n >= 3, where u = p(2,x), v = 1 - 3x - 2*x^2.