A368156 - cp's OEIS frontend

A368156 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) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 + x^2.

n	a(n)
1	1
2	1
3	2
4	2
5	4
6	5
7	3
8	10
9	14
10	12
11	5
12	20
13	41
14	44
15	29
16	8
17	40
18	98
19	148
20	131
21	70
22	13
23	76
24	224
25	408
26	497
27	376
28	169
29	21
30	142
31	482
32	1044
33	1542
34	1588
35	1052
36	408
37	34
38	260
39	1003
40	2492
41	4351
42	5456
43	4894
44	2888
45	985
46	55
47	470
48	2026
49	5684
50	11359
51	16790
52	18400
53	14672
54	7813

[1, 1, 2, 2, 4, 5, 3, 10, 14, 12, 5, 20, 41, 44, 29, 8, 40, 98, 148, 131, 70, 13, 76, 224, 408, 497, 376, 169, 21, 142, 482, 1044, 1542, 1588, 1052, 408, 34, 260, 1003, 2492, 4351, 5456, 4894, 2888, 985, 55, 470, 2026, 5684, 11359, 16790, 18400, 14672, 7813]

cp's OEIS Frontend

A368156 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) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 + x^2.

Table of values

List of values

cp's OEIS Frontend

A368156 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 + x^2.

Table of values

List of values

A368156 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) + v*p(n-2,x) for n >= 3, where u = p(2,x), v = 1 + x^2.