A332359 - cp's OEIS frontend

A332359 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 edges in the partition, for m >= n >= 1.

n	a(n)
1	3
2	5
3	10
4	7
5	17
6	30
7	9
8	26
9	49
10	82
11	11
12	37
13	71
14	121
15	180
16	13
17	50
18	99
19	172
20	259
21	374
22	15
23	65
24	130
25	227
26	342
27	495
28	656
29	17
30	82
31	167
32	294
33	445
34	646
35	859
36	1126
37	19
38	101
39	207
40	367
41	557
42	811
43	1080
44	1417
45	1784
46	21
47	122
48	253
49	450
50	685
51	1000
52	1333
53	1750
54	2205
55	2726
56	23
57	145
58	302
59	539
60	821
61	1199
62	1597
63	2097
64	2642
65	3267
66	3916

[3, 5, 10, 7, 17, 30, 9, 26, 49, 82, 11, 37, 71, 121, 180, 13, 50, 99, 172, 259, 374, 15, 65, 130, 227, 342, 495, 656, 17, 82, 167, 294, 445, 646, 859, 1126, 19, 101, 207, 367, 557, 811, 1080, 1417, 1784, 21, 122, 253, 450, 685, 1000, 1333, 1750, 2205, 2726, 23, 145, 302, 539, 821, 1199, 1597, 2097, 2642, 3267, 3916]

cp's OEIS Frontend

A332359 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 edges in the partition, for m >= n >= 1.

Table of values

List of values

cp's OEIS Frontend

A332359 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 edges in the partition, for m >= n >= 1.

Table of values

List of values

A332359 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 edges in the partition, for m >= n >= 1.