A140993 - cp's OEIS frontend

A140993 Triangle G(n, k) read by rows, for 1 <= k <= n, where G(n, n) = G(n+1, 1) = 1, G(n+2, 2) = 2, G(n+3, m) = G(n+1, m-1) + G(n+1, m-2) + G(n+2, m-1) for n >= 1 and m = 3..(n+2).

n	a(n)
1	1
2	1
3	1
4	1
5	2
6	1
7	1
8	2
9	4
10	1
11	1
12	2
13	5
14	7
15	1
16	1
17	2
18	5
19	11
20	12
21	1
22	1
23	2
24	5
25	12
26	23
27	20
28	1
29	1
30	2
31	5
32	12
33	28
34	46
35	33
36	1
37	1
38	2
39	5
40	12
41	29
42	63
43	89
44	54
45	1
46	1
47	2
48	5
49	12
50	29
51	69
52	137
53	168
54	88
55	1
56	1
57	2
58	5
59	12
60	29
61	70
62	161
63	289
64	311
65	143
66	1
67	1
68	2
69	5
70	12
71	29
72	70
73	168
74	367
75	594
76	567
77	232
78	1
79	1
80	2
81	5
82	12
83	29
84	70
85	169
86	399
87	817
88	1194
89	1021
90	376
91	1

[1, 1, 1, 1, 2, 1, 1, 2, 4, 1, 1, 2, 5, 7, 1, 1, 2, 5, 11, 12, 1, 1, 2, 5, 12, 23, 20, 1, 1, 2, 5, 12, 28, 46, 33, 1, 1, 2, 5, 12, 29, 63, 89, 54, 1, 1, 2, 5, 12, 29, 69, 137, 168, 88, 1, 1, 2, 5, 12, 29, 70, 161, 289, 311, 143, 1, 1, 2, 5, 12, 29, 70, 168, 367, 594, 567, 232, 1, 1, 2, 5, 12, 29, 70, 169, 399, 817, 1194, 1021, 376, 1]

cp's OEIS Frontend

A140993 Triangle G(n, k) read by rows, for 1 <= k <= n, where G(n, n) = G(n+1, 1) = 1, G(n+2, 2) = 2, G(n+3, m) = G(n+1, m-1) + G(n+1, m-2) + G(n+2, m-1) for n >= 1 and m = 3..(n+2).

Table of values

List of values