A136093 - cp's OEIS frontend

A136093 A generalized ( Shabat) type tree transformed Chebyshev recursion where: P(x,n)->CP(cx+d,n)+D: C=-1;c=-1;D=1;d=1: with substitution: x-1->x; as a triangular sequence of coefficients.

n	a(n)
1	1
2	0
3	1
4	-1
5	-1
6	1
7	0
8	-3
9	-1
10	1
11	1
12	0
13	-4
14	-1
15	1
16	0
17	3
18	1
19	-5
20	-1
21	1
22	-1
23	-1
24	7
25	2
26	-6
27	-1
28	1
29	0
30	-5
31	-2
32	12
33	3
34	-7
35	-1
36	1
37	1
38	0
39	-12
40	-4
41	18
42	4
43	-8
44	-1
45	1
46	0
47	5
48	2
49	-24
50	-7
51	25
52	5
53	-9
54	-1
55	1
56	-1
57	-1
58	17
59	6
60	-42
61	-11
62	33
63	6
64	-10
65	-1
66	1

[1, 0, 1, -1, -1, 1, 0, -3, -1, 1, 1, 0, -4, -1, 1, 0, 3, 1, -5, -1, 1, -1, -1, 7, 2, -6, -1, 1, 0, -5, -2, 12, 3, -7, -1, 1, 1, 0, -12, -4, 18, 4, -8, -1, 1, 0, 5, 2, -24, -7, 25, 5, -9, -1, 1, -1, -1, 17, 6, -42, -11, 33, 6, -10, -1, 1]

cp's OEIS Frontend

A136093 A generalized ( Shabat) type tree transformed Chebyshev recursion where: P(x,n)->CP(cx+d,n)+D: C=-1;c=-1;D=1;d=1: with substitution: x-1->x; as a triangular sequence of coefficients.

Table of values

List of values

n	a(n)
1	1
2	0
3	1
4	-1
5	-1
6	1
7	0
8	-3
9	-1
10	1
11	1
12	0
13	-4
14	-1
15	1
16	0
17	3
18	1
19	-5
20	-1
21	1
22	-1
23	-1
24	7
25	2
26	-6
27	-1
28	1
29	0
30	-5
31	-2
32	12
33	3
34	-7
35	-1
36	1
37	1
38	0
39	-12
40	-4
41	18
42	4
43	-8
44	-1
45	1
46	0
47	5
48	2
49	-24
50	-7
51	25
52	5
53	-9
54	-1
55	1
56	-1
57	-1
58	17
59	6
60	-42
61	-11
62	33
63	6
64	-10
65	-1
66	1

n	a(n)
1	1
2	0
3	1
4	-1
5	-1
6	1
7	0
8	-3
9	-1
10	1
11	1
12	0
13	-4
14	-1
15	1
16	0
17	3
18	1
19	-5
20	-1
21	1
22	-1
23	-1
24	7
25	2
26	-6
27	-1
28	1
29	0
30	-5
31	-2
32	12
33	3
34	-7
35	-1
36	1
37	1
38	0
39	-12
40	-4
41	18
42	4
43	-8
44	-1
45	1
46	0
47	5
48	2
49	-24
50	-7
51	25
52	5
53	-9
54	-1
55	1
56	-1
57	-1
58	17
59	6
60	-42
61	-11
62	33
63	6
64	-10
65	-1
66	1

cp's OEIS Frontend

A136093 A generalized ( Shabat) type tree transformed Chebyshev recursion where: P(x,n)->C*P(c*x+d,n)+D: C=-1;c=-1;D=1;d=1: with substitution: x-1->x; as a triangular sequence of coefficients.

Table of values

List of values

A136093 A generalized ( Shabat) type tree transformed Chebyshev recursion where: P(x,n)->CP(cx+d,n)+D: C=-1;c=-1;D=1;d=1: with substitution: x-1->x; as a triangular sequence of coefficients.

n	a(n)
1	1
2	0
3	1
4	-1
5	-1
6	1
7	0
8	-3
9	-1
10	1
11	1
12	0
13	-4
14	-1
15	1
16	0
17	3
18	1
19	-5
20	-1
21	1
22	-1
23	-1
24	7
25	2
26	-6
27	-1
28	1
29	0
30	-5
31	-2
32	12
33	3
34	-7
35	-1
36	1
37	1
38	0
39	-12
40	-4
41	18
42	4
43	-8
44	-1
45	1
46	0
47	5
48	2
49	-24
50	-7
51	25
52	5
53	-9
54	-1
55	1
56	-1
57	-1
58	17
59	6
60	-42
61	-11
62	33
63	6
64	-10
65	-1
66	1