A309108 - cp's OEIS frontend

A309108 Lexicographically earliest sequence such that the product a(j)a(j+k)a(j+2k) for any j and k is a unique positive integer.

n	a(n)
0	1
1	1
2	1
3	2
4	3
5	2
6	5
7	6
8	7
9	4
10	10
11	9
12	7
13	11
14	12
15	8
16	13
17	11
18	17
19	19
20	15
21	23
22	7
23	14
24	16
25	12
26	27
27	13
28	25
29	29
30	31
31	37
32	33
33	30
34	26
35	16
36	20
37	27
38	34
39	29
40	35
41	18
42	41
43	43
44	47
45	53
46	39
47	37
48	49
49	51
50	59
51	38
52	40
53	41
54	46
55	47
56	42
57	19
58	31
59	44
60	55
61	56
62	61
63	57
64	67
65	64
66	45
67	71
68	62

[1, 1, 1, 2, 3, 2, 5, 6, 7, 4, 10, 9, 7, 11, 12, 8, 13, 11, 17, 19, 15, 23, 7, 14, 16, 12, 27, 13, 25, 29, 31, 37, 33, 30, 26, 16, 20, 27, 34, 29, 35, 18, 41, 43, 47, 53, 39, 37, 49, 51, 59, 38, 40, 41, 46, 47, 42, 19, 31, 44, 55, 56, 61, 57, 67, 64, 45, 71, 62]

cp's OEIS Frontend

A309108 Lexicographically earliest sequence such that the product a(j)a(j+k)a(j+2k) for any j and k is a unique positive integer.

Table of values

List of values

n	a(n)
0	1
1	1
2	1
3	2
4	3
5	2
6	5
7	6
8	7
9	4
10	10
11	9
12	7
13	11
14	12
15	8
16	13
17	11
18	17
19	19
20	15
21	23
22	7
23	14
24	16
25	12
26	27
27	13
28	25
29	29
30	31
31	37
32	33
33	30
34	26
35	16
36	20
37	27
38	34
39	29
40	35
41	18
42	41
43	43
44	47
45	53
46	39
47	37
48	49
49	51
50	59
51	38
52	40
53	41
54	46
55	47
56	42
57	19
58	31
59	44
60	55
61	56
62	61
63	57
64	67
65	64
66	45
67	71
68	62

n	a(n)
0	1
1	1
2	1
3	2
4	3
5	2
6	5
7	6
8	7
9	4
10	10
11	9
12	7
13	11
14	12
15	8
16	13
17	11
18	17
19	19
20	15
21	23
22	7
23	14
24	16
25	12
26	27
27	13
28	25
29	29
30	31
31	37
32	33
33	30
34	26
35	16
36	20
37	27
38	34
39	29
40	35
41	18
42	41
43	43
44	47
45	53
46	39
47	37
48	49
49	51
50	59
51	38
52	40
53	41
54	46
55	47
56	42
57	19
58	31
59	44
60	55
61	56
62	61
63	57
64	67
65	64
66	45
67	71
68	62

cp's OEIS Frontend

A309108 Lexicographically earliest sequence such that the product a(j)*a(j+k)*a(j+2k) for any j and k is a unique positive integer.

Table of values

List of values

A309108 Lexicographically earliest sequence such that the product a(j)a(j+k)a(j+2k) for any j and k is a unique positive integer.

n	a(n)
0	1
1	1
2	1
3	2
4	3
5	2
6	5
7	6
8	7
9	4
10	10
11	9
12	7
13	11
14	12
15	8
16	13
17	11
18	17
19	19
20	15
21	23
22	7
23	14
24	16
25	12
26	27
27	13
28	25
29	29
30	31
31	37
32	33
33	30
34	26
35	16
36	20
37	27
38	34
39	29
40	35
41	18
42	41
43	43
44	47
45	53
46	39
47	37
48	49
49	51
50	59
51	38
52	40
53	41
54	46
55	47
56	42
57	19
58	31
59	44
60	55
61	56
62	61
63	57
64	67
65	64
66	45
67	71
68	62