A262942 - cp's OEIS frontend

A262942 Sequence of positive integers where each is chosen to be as small as possible subject to the conditions that no three terms a(j), a(j+k), a(j+2*k) (for any j and k) form an arithmetic progression (in any order) and that no term repeats.

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

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

cp's OEIS Frontend

A262942 Sequence of positive integers where each is chosen to be as small as possible subject to the conditions that no three terms a(j), a(j+k), a(j+2*k) (for any j and k) form an arithmetic progression (in any order) and that no term repeats.

Table of values

List of values

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

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

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