A026747 - cp's OEIS frontend

A026747 Triangular array T read by rows: T(n,0)=T(n,n)=1 for n >= 0; for n >= 2 and 1 <= k <= n-1, T(n,k) = T(n-1,k-1) + T(n-2,k-1) + T(n-1,k) if n is even and 1 <= k <= n/2, else T(n,k) = T(n-1,k-1) + T(n-1,k).

n	a(n)
0	1
1	1
2	1
3	1
4	3
5	1
6	1
7	4
8	4
9	1
10	1
11	6
12	11
13	5
14	1
15	1
16	7
17	17
18	16
19	6
20	1
21	1
22	9
23	30
24	44
25	22
26	7
27	1
28	1
29	10
30	39
31	74
32	66
33	29
34	8
35	1
36	1
37	12
38	58
39	143
40	184
41	95
42	37
43	9
44	1
45	1
46	13
47	70
48	201
49	327
50	279
51	132
52	46
53	10
54	1
55	1
56	15
57	95
58	329
59	671
60	790
61	411
62	178
63	56
64	11
65	1
66	1
67	16
68	110
69	424
70	1000
71	1461
72	1201
73	589
74	234
75	67
76	12
77	1

[1, 1, 1, 1, 3, 1, 1, 4, 4, 1, 1, 6, 11, 5, 1, 1, 7, 17, 16, 6, 1, 1, 9, 30, 44, 22, 7, 1, 1, 10, 39, 74, 66, 29, 8, 1, 1, 12, 58, 143, 184, 95, 37, 9, 1, 1, 13, 70, 201, 327, 279, 132, 46, 10, 1, 1, 15, 95, 329, 671, 790, 411, 178, 56, 11, 1, 1, 16, 110, 424, 1000, 1461, 1201, 589, 234, 67, 12, 1]

cp's OEIS Frontend

A026747 Triangular array T read by rows: T(n,0)=T(n,n)=1 for n >= 0; for n >= 2 and 1 <= k <= n-1, T(n,k) = T(n-1,k-1) + T(n-2,k-1) + T(n-1,k) if n is even and 1 <= k <= n/2, else T(n,k) = T(n-1,k-1) + T(n-1,k).

Table of values

List of values