A118340 - cp's OEIS frontend

A118340 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) + 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	4
13	1
14	0
15	1
16	4
17	9
18	5
19	1
20	0
21	1
22	5
23	15
24	20
25	6
26	1
27	0
28	1
29	6
30	22
31	48
32	28
33	7
34	1
35	0
36	1
37	7
38	30
39	85
40	113
41	37
42	8
43	1
44	0
45	1
46	8
47	39
48	132
49	282
50	169
51	47
52	9
53	1
54	0
55	1
56	9
57	49
58	190
59	519
60	688
61	237
62	58
63	10
64	1
65	0
66	1
67	10
68	60
69	260
70	837
71	1762
72	1074
73	318
74	70
75	11
76	1
77	0

[1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 3, 4, 1, 0, 1, 4, 9, 5, 1, 0, 1, 5, 15, 20, 6, 1, 0, 1, 6, 22, 48, 28, 7, 1, 0, 1, 7, 30, 85, 113, 37, 8, 1, 0, 1, 8, 39, 132, 282, 169, 47, 9, 1, 0, 1, 9, 49, 190, 519, 688, 237, 58, 10, 1, 0, 1, 10, 60, 260, 837, 1762, 1074, 318, 70, 11, 1, 0]

cp's OEIS Frontend

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