A332361 - cp's OEIS frontend

A332361 Consider a partition of the triangle with vertices (0, 0), (1, 0), (0, 1) by the lines a_1x_1 + a_2x_2 = 1, where (x_1, x_2) is in {1, 2,...,m} X {1, 2,...,n}, m >= 1, n >= 1. Triangle read by rows: T(m,n) = number of vertices in the partition, for m >= n >= 1.

n	a(n)
1	3
2	4
3	6
4	5
5	9
6	14
7	6
8	13
9	22
10	36
11	7
12	18
13	31
14	52
15	76
16	8
17	24
18	43
19	74
20	110
21	160
22	9
23	31
24	56
25	97
26	144
27	210
28	276
29	10
30	39
31	72
32	126
33	188
34	275
35	363
36	478
37	11
38	48
39	89
40	157
41	235
42	345
43	456
44	601
45	756
46	12
47	58
48	109
49	193
50	290
51	427
52	565
53	745
54	938
55	1164
56	13
57	69
58	130
59	231
60	347
61	511
62	675
63	890
64	1120
65	1390
66	1660

[3, 4, 6, 5, 9, 14, 6, 13, 22, 36, 7, 18, 31, 52, 76, 8, 24, 43, 74, 110, 160, 9, 31, 56, 97, 144, 210, 276, 10, 39, 72, 126, 188, 275, 363, 478, 11, 48, 89, 157, 235, 345, 456, 601, 756, 12, 58, 109, 193, 290, 427, 565, 745, 938, 1164, 13, 69, 130, 231, 347, 511, 675, 890, 1120, 1390, 1660]

cp's OEIS Frontend

A332361 Consider a partition of the triangle with vertices (0, 0), (1, 0), (0, 1) by the lines a_1x_1 + a_2x_2 = 1, where (x_1, x_2) is in {1, 2,...,m} X {1, 2,...,n}, m >= 1, n >= 1. Triangle read by rows: T(m,n) = number of vertices in the partition, for m >= n >= 1.

Table of values

List of values

cp's OEIS Frontend

A332361 Consider a partition of the triangle with vertices (0, 0), (1, 0), (0, 1) by the lines a_1*x_1 + a_2*x_2 = 1, where (x_1, x_2) is in {1, 2,...,m} X {1, 2,...,n}, m >= 1, n >= 1. Triangle read by rows: T(m,n) = number of vertices in the partition, for m >= n >= 1.

Table of values

List of values

A332361 Consider a partition of the triangle with vertices (0, 0), (1, 0), (0, 1) by the lines a_1x_1 + a_2x_2 = 1, where (x_1, x_2) is in {1, 2,...,m} X {1, 2,...,n}, m >= 1, n >= 1. Triangle read by rows: T(m,n) = number of vertices in the partition, for m >= n >= 1.