A306717 - cp's OEIS frontend

A306717 Square array T(n, k) of positive integers, n > 0, k > 0, read by antidiagonals, filled the greedy way, such that for any i >= 0 and j >= 0 with i + j > 0, no three terms T(n, k), T(n+i, k+j), T(n+2i, k+2j) form an arithmetic progression.

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

[1, 1, 1, 2, 1, 2, 1, 2, 2, 1, 1, 1, 3, 1, 1, 2, 1, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 4, 2, 3, 1, 1, 3, 2, 4, 4, 4, 5, 2, 1, 2, 5, 4, 4, 1, 4, 5, 4, 2, 2, 4, 5, 4, 1, 1, 1, 7, 2, 4, 3, 4, 2, 7, 1, 1, 2, 1, 2, 5, 4, 5, 5, 4, 5, 2, 1, 2, 1, 2, 5, 1, 5, 5, 4, 5, 5]

cp's OEIS Frontend

A306717 Square array T(n, k) of positive integers, n > 0, k > 0, read by antidiagonals, filled the greedy way, such that for any i >= 0 and j >= 0 with i + j > 0, no three terms T(n, k), T(n+i, k+j), T(n+2i, k+2j) form an arithmetic progression.

Table of values

List of values

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

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

cp's OEIS Frontend

A306717 Square array T(n, k) of positive integers, n > 0, k > 0, read by antidiagonals, filled the greedy way, such that for any i >= 0 and j >= 0 with i + j > 0, no three terms T(n, k), T(n+i, k+j), T(n+2*i, k+2*j) form an arithmetic progression.

Table of values

List of values

A306717 Square array T(n, k) of positive integers, n > 0, k > 0, read by antidiagonals, filled the greedy way, such that for any i >= 0 and j >= 0 with i + j > 0, no three terms T(n, k), T(n+i, k+j), T(n+2i, k+2j) form an arithmetic progression.

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