A137408 - cp's OEIS frontend

A137408 Triangular sequence from coefficients of a switched even -odd polynomial recursion: odd:p(x,n)=2xp(x, n - 1) - p(x, n - 2); even:p(x,n)=(1 - 2x)p(x, n - 1) - p(x, n - 2);.

n	a(n)
1	1
2	0
3	2
4	-1
5	2
6	-4
7	0
8	-4
9	4
10	-8
11	1
12	-6
13	16
14	-16
15	16
16	0
17	6
18	-16
19	40
20	-32
21	32
22	-1
23	12
24	-44
25	88
26	-128
27	96
28	-64
29	0
30	-8
31	40
32	-128
33	208
34	-288
35	192
36	-128
37	1
38	-20
39	100
40	-296
41	592
42	-800
43	832
44	-512
45	256
46	0
47	10
48	-80
49	328
50	-800
51	1472
52	-1792
53	1792
54	-1024
55	512
56	-1

[1, 0, 2, -1, 2, -4, 0, -4, 4, -8, 1, -6, 16, -16, 16, 0, 6, -16, 40, -32, 32, -1, 12, -44, 88, -128, 96, -64, 0, -8, 40, -128, 208, -288, 192, -128, 1, -20, 100, -296, 592, -800, 832, -512, 256, 0, 10, -80, 328, -800, 1472, -1792, 1792, -1024, 512, -1]

cp's OEIS Frontend

A137408 Triangular sequence from coefficients of a switched even -odd polynomial recursion: odd:p(x,n)=2xp(x, n - 1) - p(x, n - 2); even:p(x,n)=(1 - 2x)p(x, n - 1) - p(x, n - 2);.

Table of values

List of values

cp's OEIS Frontend

A137408 Triangular sequence from coefficients of a switched even -odd polynomial recursion: odd:p(x,n)=2*x*p(x, n - 1) - p(x, n - 2); even:p(x,n)=(1 - 2*x)*p(x, n - 1) - p(x, n - 2);.

Table of values

List of values

A137408 Triangular sequence from coefficients of a switched even -odd polynomial recursion: odd:p(x,n)=2xp(x, n - 1) - p(x, n - 2); even:p(x,n)=(1 - 2x)p(x, n - 1) - p(x, n - 2);.