A122445 - cp's OEIS frontend

A122445 Pendular trinomial triangle, read by rows of 2n+1 terms (n>=0), defined by the recurrence: if 0 < k < n, T(n,k) = T(n-1,k) + 2*T(n,2n-1-k); otherwise, if n-1 < k < 2n-1, T(n,k) = T(n-1,k) + T(n,2n-2-k); with T(n,0) = T(n+1,2n) = 1 and T(n+1,2n+1) = T(n+1,2n+2) = 0.

n	a(n)
0	1
1	1
2	0
3	0
4	1
5	1
6	1
7	0
8	0
9	1
10	2
11	3
12	2
13	1
14	0
15	0
16	1
17	3
18	6
19	10
20	8
21	3
22	1
23	0
24	0
25	1
26	4
27	10
28	22
29	36
30	28
31	12
32	4
33	1
34	0
35	0
36	1
37	5
38	15
39	39
40	83
41	135
42	107
43	47
44	17
45	5
46	1
47	0
48	0
49	1
50	6
51	21
52	62
53	155
54	324
55	525
56	418
57	189
58	72
59	23
60	6
61	1
62	0
63	0
64	1
65	7
66	28
67	92
68	259
69	629
70	1298
71	2094
72	1676
73	773
74	305
75	104
76	30
77	7
78	1
79	0
80	0

[1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 2, 3, 2, 1, 0, 0, 1, 3, 6, 10, 8, 3, 1, 0, 0, 1, 4, 10, 22, 36, 28, 12, 4, 1, 0, 0, 1, 5, 15, 39, 83, 135, 107, 47, 17, 5, 1, 0, 0, 1, 6, 21, 62, 155, 324, 525, 418, 189, 72, 23, 6, 1, 0, 0, 1, 7, 28, 92, 259, 629, 1298, 2094, 1676, 773, 305, 104, 30, 7, 1, 0, 0]

cp's OEIS Frontend

A122445 Pendular trinomial triangle, read by rows of 2n+1 terms (n>=0), defined by the recurrence: if 0 < k < n, T(n,k) = T(n-1,k) + 2*T(n,2n-1-k); otherwise, if n-1 < k < 2n-1, T(n,k) = T(n-1,k) + T(n,2n-2-k); with T(n,0) = T(n+1,2n) = 1 and T(n+1,2n+1) = T(n+1,2n+2) = 0.

Table of values

List of values