A118345 - cp's OEIS frontend

A118345 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) + 2*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	5
13	1
14	0
15	1
16	4
17	11
18	6
19	1
20	0
21	1
22	5
23	18
24	30
25	7
26	1
27	0
28	1
29	6
30	26
31	70
32	40
33	8
34	1
35	0
36	1
37	7
38	35
39	121
40	201
41	51
42	9
43	1
44	0
45	1
46	8
47	45
48	184
49	487
50	286
51	63
52	10
53	1
54	0
55	1
56	9
57	56
58	260
59	873
60	1445
61	386
62	76
63	11
64	1
65	0
66	1
67	10
68	68
69	350
70	1375
71	3592
72	2147
73	502
74	90
75	12
76	1
77	0

[1, 1, 0, 1, 1, 0, 1, 2, 1, 0, 1, 3, 5, 1, 0, 1, 4, 11, 6, 1, 0, 1, 5, 18, 30, 7, 1, 0, 1, 6, 26, 70, 40, 8, 1, 0, 1, 7, 35, 121, 201, 51, 9, 1, 0, 1, 8, 45, 184, 487, 286, 63, 10, 1, 0, 1, 9, 56, 260, 873, 1445, 386, 76, 11, 1, 0, 1, 10, 68, 350, 1375, 3592, 2147, 502, 90, 12, 1, 0]

cp's OEIS Frontend

A118345 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) + 2*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