A136337 - cp's OEIS frontend

A136337 Triangular sequence from both a quartic expansion polynomial and a four deep polynomial recursion: Expansion polynomial: f(x,t)=1/(1 - 2xt + t^4); Recursion polynomials: p(x, n) = 2xp(x, n - 1) - p(x, n - 4);.

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

[1, 0, 2, 0, 0, 4, 0, 0, 0, 8, -1, 0, 0, 0, 16, 0, -4, 0, 0, 0, 32, 0, 0, -12, 0, 0, 0, 64, 0, 0, 0, -32, 0, 0, 0, 128, 1, 0, 0, 0, -80, 0, 0, 0, 256, 0, 6, 0, 0, 0, -192, 0, 0, 0, 512, 0, 0, 24, 0, 0, 0, -448, 0, 0, 0, 1024]

cp's OEIS Frontend

A136337 Triangular sequence from both a quartic expansion polynomial and a four deep polynomial recursion: Expansion polynomial: f(x,t)=1/(1 - 2xt + t^4); Recursion polynomials: p(x, n) = 2xp(x, n - 1) - p(x, n - 4);.

Table of values

List of values

cp's OEIS Frontend

A136337 Triangular sequence from both a quartic expansion polynomial and a four deep polynomial recursion: Expansion polynomial: f(x,t)=1/(1 - 2*x*t + t^4); Recursion polynomials: p(x, n) = 2*x*p(x, n - 1) - p(x, n - 4);.

Table of values

List of values

A136337 Triangular sequence from both a quartic expansion polynomial and a four deep polynomial recursion: Expansion polynomial: f(x,t)=1/(1 - 2xt + t^4); Recursion polynomials: p(x, n) = 2xp(x, n - 1) - p(x, n - 4);.