A351700 - cp's OEIS frontend

A351700 T(n,k) is the maximum number of points that can be chosen from a rectangle of n X k lattice points such that their mutual distances are distinct, where T(n,k) is a triangle read by rows, 1 <= k <= n.

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

[1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 3, 4, 4, 5, 5, 3, 4, 5, 5, 5, 6, 4, 5, 5, 6, 6, 6, 7, 4, 5, 5, 6, 7, 7, 7, 7, 4, 5, 6, 6, 7, 7, 8, 8, 8, 4, 6, 6, 7, 7, 8, 8, 8, 9, 9, 4, 6, 6, 7, 8, 8, 8, 9, 9, 9, 10, 5, 6, 7, 7, 8, 9, 9, 9, 9, 10, 10, 10, 5, 6, 7, 8, 8, 9, 9, 10, 10, 10, 10, 11, 11]

cp's OEIS Frontend

A351700 T(n,k) is the maximum number of points that can be chosen from a rectangle of n X k lattice points such that their mutual distances are distinct, where T(n,k) is a triangle read by rows, 1 <= k <= n.

Table of values

List of values

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

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

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