A167769 - cp's OEIS frontend

A167769 Pendular trinomial triangle (p=0), read by rows of 2n+1 terms (n>=0), defined by the recurrence : if 0 T(n,k)= T(n-1,k) + p*T(n,2n-1-k); else if n-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	8
20	6
21	3
22	1
23	0
24	0
25	1
26	4
27	10
28	18
29	24
30	18
31	10
32	4
33	1
34	0
35	0
36	1
37	5
38	15
39	33
40	57
41	75
42	57
43	33
44	15
45	5
46	1
47	0
48	0
49	1
50	6
51	21
52	54
53	111
54	186
55	243
56	186
57	111
58	54
59	21
60	6
61	1
62	0
63	0
64	1
65	7
66	28
67	82
68	193
69	379
70	622
71	808
72	622
73	379
74	193
75	82
76	28
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, 8, 6, 3, 1, 0, 0, 1, 4, 10, 18, 24, 18, 10, 4, 1, 0, 0, 1, 5, 15, 33, 57, 75, 57, 33, 15, 5, 1, 0, 0, 1, 6, 21, 54, 111, 186, 243, 186, 111, 54, 21, 6, 1, 0, 0, 1, 7, 28, 82, 193, 379, 622, 808, 622, 379, 193, 82, 28, 7, 1, 0, 0]

cp's OEIS Frontend

A167769 Pendular trinomial triangle (p=0), read by rows of 2n+1 terms (n>=0), defined by the recurrence : if 0 T(n,k)= T(n-1,k) + p*T(n,2n-1-k); else if n-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

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	8
20	6
21	3
22	1
23	0
24	0
25	1
26	4
27	10
28	18
29	24
30	18
31	10
32	4
33	1
34	0
35	0
36	1
37	5
38	15
39	33
40	57
41	75
42	57
43	33
44	15
45	5
46	1
47	0
48	0
49	1
50	6
51	21
52	54
53	111
54	186
55	243
56	186
57	111
58	54
59	21
60	6
61	1
62	0
63	0
64	1
65	7
66	28
67	82
68	193
69	379
70	622
71	808
72	622
73	379
74	193
75	82
76	28
77	7
78	1
79	0
80	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	8
20	6
21	3
22	1
23	0
24	0
25	1
26	4
27	10
28	18
29	24
30	18
31	10
32	4
33	1
34	0
35	0
36	1
37	5
38	15
39	33
40	57
41	75
42	57
43	33
44	15
45	5
46	1
47	0
48	0
49	1
50	6
51	21
52	54
53	111
54	186
55	243
56	186
57	111
58	54
59	21
60	6
61	1
62	0
63	0
64	1
65	7
66	28
67	82
68	193
69	379
70	622
71	808
72	622
73	379
74	193
75	82
76	28
77	7
78	1
79	0
80	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	8
20	6
21	3
22	1
23	0
24	0
25	1
26	4
27	10
28	18
29	24
30	18
31	10
32	4
33	1
34	0
35	0
36	1
37	5
38	15
39	33
40	57
41	75
42	57
43	33
44	15
45	5
46	1
47	0
48	0
49	1
50	6
51	21
52	54
53	111
54	186
55	243
56	186
57	111
58	54
59	21
60	6
61	1
62	0
63	0
64	1
65	7
66	28
67	82
68	193
69	379
70	622
71	808
72	622
73	379
74	193
75	82
76	28
77	7
78	1
79	0
80	0