A118350 - cp's OEIS frontend

A118350 Pendular triangle, read by rows, where row n is formed from row n-1 by the recurrence: if n > 2k, T(n,k) = T(n,n-k) + T(n-1,k), else T(n,k) = T(n,n-1-k) + 3*T(n-1,k), for n>=k>=0, with T(n,0)=1 and T(n,n)=0^n.

n	a(n)
0	1
1	1
2	0
3	1
4	1
5	0
6	1
7	2
8	1
9	0
10	1
11	3
12	6
13	1
14	0
15	1
16	4
17	13
18	7
19	1
20	0
21	1
22	5
23	21
24	42
25	8
26	1
27	0
28	1
29	6
30	30
31	96
32	54
33	9
34	1
35	0
36	1
37	7
38	40
39	163
40	325
41	67
42	10
43	1
44	0
45	1
46	8
47	51
48	244
49	770
50	445
51	81
52	11
53	1
54	0
55	1
56	9
57	63
58	340
59	1353
60	2688
61	583
62	96
63	12
64	1
65	0
66	1
67	10
68	76
69	452
70	2093
71	6530
72	3842
73	740
74	112
75	13
76	1
77	0

[1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 3, 6, 1, 0, 1, 4, 13, 7, 1, 0, 1, 5, 21, 42, 8, 1, 0, 1, 6, 30, 96, 54, 9, 1, 0, 1, 7, 40, 163, 325, 67, 10, 1, 0, 1, 8, 51, 244, 770, 445, 81, 11, 1, 0, 1, 9, 63, 340, 1353, 2688, 583, 96, 12, 1, 0, 1, 10, 76, 452, 2093, 6530, 3842, 740, 112, 13, 1, 0]

cp's OEIS Frontend

A118350 Pendular triangle, read by rows, where row n is formed from row n-1 by the recurrence: if n > 2k, T(n,k) = T(n,n-k) + T(n-1,k), else T(n,k) = T(n,n-1-k) + 3*T(n-1,k), for n>=k>=0, with T(n,0)=1 and T(n,n)=0^n.

Table of values

List of values