A026769 - cp's OEIS frontend

A026769 Triangular array T read by rows: T(n,0)=T(n,n)=1 for n >= 0; T(2,1)=2; for n >= 3 and 1<=k<=n-1, T(n,k) = T(n-1,k-1) + T(n-2,k-1) + T(n-1,k) if 1<=k<=(n-1)/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	2
5	1
6	1
7	4
8	3
9	1
10	1
11	6
12	7
13	4
14	1
15	1
16	8
17	17
18	11
19	5
20	1
21	1
22	10
23	31
24	28
25	16
26	6
27	1
28	1
29	12
30	49
31	76
32	44
33	22
34	7
35	1
36	1
37	14
38	71
39	156
40	120
41	66
42	29
43	8
44	1
45	1
46	16
47	97
48	276
49	352
50	186
51	95
52	37
53	9
54	1
55	1
56	18
57	127
58	444
59	784
60	538
61	281
62	132
63	46
64	10
65	1
66	1
67	20
68	161
69	668
70	1504
71	1674
72	819
73	413
74	178
75	56
76	11
77	1

[1, 1, 1, 1, 2, 1, 1, 4, 3, 1, 1, 6, 7, 4, 1, 1, 8, 17, 11, 5, 1, 1, 10, 31, 28, 16, 6, 1, 1, 12, 49, 76, 44, 22, 7, 1, 1, 14, 71, 156, 120, 66, 29, 8, 1, 1, 16, 97, 276, 352, 186, 95, 37, 9, 1, 1, 18, 127, 444, 784, 538, 281, 132, 46, 10, 1, 1, 20, 161, 668, 1504, 1674, 819, 413, 178, 56, 11, 1]

cp's OEIS Frontend

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

Table of values

List of values