A006255 - cp's OEIS frontend

A006255 R. L. Graham's sequence: a(n) = smallest m for which there is a sequence n = b_1 < b_2 < ... < b_t = m such that b_1b_2...*b_t is a perfect square.

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

[1, 6, 8, 4, 10, 12, 14, 15, 9, 18, 22, 20, 26, 21, 24, 16, 34, 27, 38, 30, 28, 33, 46, 32, 25, 39, 35, 40, 58, 42, 62, 45, 44, 51, 48, 36, 74, 57, 52, 50, 82, 56, 86, 55, 60, 69, 94, 54, 49, 63, 68, 65, 106, 70, 66, 72, 76, 87, 118, 75, 122, 93, 77, 64, 78, 80, 134, 85, 92, 84]

cp's OEIS Frontend

A006255 R. L. Graham's sequence: a(n) = smallest m for which there is a sequence n = b_1 < b_2 < ... < b_t = m such that b_1b_2...*b_t is a perfect square.

Table of values

List of values

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

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

cp's OEIS Frontend

A006255 R. L. Graham's sequence: a(n) = smallest m for which there is a sequence n = b_1 < b_2 < ... < b_t = m such that b_1*b_2*...*b_t is a perfect square.

Table of values

List of values

A006255 R. L. Graham's sequence: a(n) = smallest m for which there is a sequence n = b_1 < b_2 < ... < b_t = m such that b_1b_2...*b_t is a perfect square.

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