A119369 - cp's OEIS frontend

A119369 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) + 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	9
20	7
21	3
22	1
23	0
24	0
25	1
26	4
27	10
28	20
29	30
30	23
31	11
32	4
33	1
34	0
35	0
36	1
37	5
38	15
39	36
40	70
41	104
42	81
43	40
44	16
45	5
46	1
47	0
48	0
49	1
50	6
51	21
52	58
53	133
54	253
55	374
56	293
57	149
58	63
59	22
60	6
61	1
62	0
63	0
64	1
65	7
66	28
67	87
68	226
69	501
70	938
71	1380
72	1087
73	564
74	248
75	93
76	29
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, 9, 7, 3, 1, 0, 0, 1, 4, 10, 20, 30, 23, 11, 4, 1, 0, 0, 1, 5, 15, 36, 70, 104, 81, 40, 16, 5, 1, 0, 0, 1, 6, 21, 58, 133, 253, 374, 293, 149, 63, 22, 6, 1, 0, 0, 1, 7, 28, 87, 226, 501, 938, 1380, 1087, 564, 248, 93, 29, 7, 1, 0, 0]

cp's OEIS Frontend

A119369 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) + 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