A271914 - cp's OEIS frontend

A271914 Symmetric array read by antidiagonals: T(n,k) (n>=1, k>=1) = maximal number of points that can be chosen in an n X k rectangular grid such that no three distinct points form an isosceles triangle.

n	a(n)
1	1
2	2
3	2
4	3
5	2
6	3
7	4
8	4
9	4
10	4
11	5
12	4
13	4
14	4
15	5
16	6
17	5
18	5
19	5
20	5
21	6
22	7
23	6
24	6
25	6
26	6
27	6
28	7
29	8
30	7
31	8
32	7
33	7
34	8
35	7
36	8
37	9
38	8
39	8
40	8
41	8
42	8
43	8
44	8
45	9
46	10
47	9
48	10
49	9
50	9
51	9
52	9
53	10
54	9
55	10

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

cp's OEIS Frontend

A271914 Symmetric array read by antidiagonals: T(n,k) (n>=1, k>=1) = maximal number of points that can be chosen in an n X k rectangular grid such that no three distinct points form an isosceles triangle.

Table of values

List of values

n	a(n)
1	1
2	2
3	2
4	3
5	2
6	3
7	4
8	4
9	4
10	4
11	5
12	4
13	4
14	4
15	5
16	6
17	5
18	5
19	5
20	5
21	6
22	7
23	6
24	6
25	6
26	6
27	6
28	7
29	8
30	7
31	8
32	7
33	7
34	8
35	7
36	8
37	9
38	8
39	8
40	8
41	8
42	8
43	8
44	8
45	9
46	10
47	9
48	10
49	9
50	9
51	9
52	9
53	10
54	9
55	10

n	a(n)
1	1
2	2
3	2
4	3
5	2
6	3
7	4
8	4
9	4
10	4
11	5
12	4
13	4
14	4
15	5
16	6
17	5
18	5
19	5
20	5
21	6
22	7
23	6
24	6
25	6
26	6
27	6
28	7
29	8
30	7
31	8
32	7
33	7
34	8
35	7
36	8
37	9
38	8
39	8
40	8
41	8
42	8
43	8
44	8
45	9
46	10
47	9
48	10
49	9
50	9
51	9
52	9
53	10
54	9
55	10

n	a(n)
1	1
2	2
3	2
4	3
5	2
6	3
7	4
8	4
9	4
10	4
11	5
12	4
13	4
14	4
15	5
16	6
17	5
18	5
19	5
20	5
21	6
22	7
23	6
24	6
25	6
26	6
27	6
28	7
29	8
30	7
31	8
32	7
33	7
34	8
35	7
36	8
37	9
38	8
39	8
40	8
41	8
42	8
43	8
44	8
45	9
46	10
47	9
48	10
49	9
50	9
51	9
52	9
53	10
54	9
55	10