A300516 - cp's OEIS frontend

A300516 a(n) is the least k such that there exists a strictly increasing sequence n = b_1 < b_2 < ... < b_t = k where lcm(b_1, b_2, ..., b_t) is square.

n	a(n)
1	1
2	4
3	9
4	4
5	25
6	12
7	49
8	16
9	9
10	25
11	121
12	18
13	169
14	49
15	25
16	16
17	289
18	25
19	361
20	25
21	49
22	121
23	529
24	48
25	25
26	169
27	81
28	49
29	841
30	50
31	961
32	64
33	121
34	289
35	50
36	36
37	1369

[1, 4, 9, 4, 25, 12, 49, 16, 9, 25, 121, 18, 169, 49, 25, 16, 289, 25, 361, 25, 49, 121, 529, 48, 25, 169, 81, 49, 841, 50, 961, 64, 121, 289, 50, 36, 1369]

cp's OEIS Frontend

A300516 a(n) is the least k such that there exists a strictly increasing sequence n = b_1 < b_2 < ... < b_t = k where lcm(b_1, b_2, ..., b_t) is square.

Table of values

List of values