A368157 - cp's OEIS frontend

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

n	a(n)
1	1
2	1
3	2
4	2
5	4
6	6
7	3
8	10
9	16
10	16
11	5
12	20
13	46
14	56
15	44
16	8
17	40
18	108
19	184
20	188
21	120
22	13
23	76
24	244
25	496
26	692
27	608
28	328
29	21
30	142
31	520
32	1248
33	2088
34	2480
35	1920
36	896
37	34
38	260
39	1074
40	2936
41	5764
42	8256
43	8592
44	5952
45	2448
46	55
47	470
48	2156
49	6616
50	14764
51	24760
52	31200
53	28992

[1, 1, 2, 2, 4, 6, 3, 10, 16, 16, 5, 20, 46, 56, 44, 8, 40, 108, 184, 188, 120, 13, 76, 244, 496, 692, 608, 328, 21, 142, 520, 1248, 2088, 2480, 1920, 896, 34, 260, 1074, 2936, 5764, 8256, 8592, 5952, 2448, 55, 470, 2156, 6616, 14764, 24760, 31200, 28992]

cp's OEIS Frontend

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

Table of values

List of values

cp's OEIS Frontend

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

Table of values

List of values

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