A026758 - cp's OEIS frontend

A026758 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 odd and 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	5
12	7
13	4
14	1
15	1
16	7
17	16
18	11
19	5
20	1
21	1
22	8
23	23
24	27
25	16
26	6
27	1
28	1
29	10
30	38
31	66
32	43
33	22
34	7
35	1
36	1
37	11
38	48
39	104
40	109
41	65
42	29
43	8
44	1
45	1
46	13
47	69
48	190
49	279
50	174
51	94
52	37
53	9
54	1
55	1
56	14
57	82
58	259
59	469
60	453
61	268
62	131
63	46
64	10
65	1
66	1
67	16
68	109
69	410
70	918
71	1201
72	721
73	399
74	177
75	56
76	11
77	1

[1, 1, 1, 1, 2, 1, 1, 4, 3, 1, 1, 5, 7, 4, 1, 1, 7, 16, 11, 5, 1, 1, 8, 23, 27, 16, 6, 1, 1, 10, 38, 66, 43, 22, 7, 1, 1, 11, 48, 104, 109, 65, 29, 8, 1, 1, 13, 69, 190, 279, 174, 94, 37, 9, 1, 1, 14, 82, 259, 469, 453, 268, 131, 46, 10, 1, 1, 16, 109, 410, 918, 1201, 721, 399, 177, 56, 11, 1]

cp's OEIS Frontend

A026758 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 odd and 1 <= k <= (n-1)/2, else T(n,k) = T(n-1,k-1) + T(n-1,k).

Table of values

List of values