A303760 - cp's OEIS frontend

A303760 Divisor-or-multiple permutation of squarefree numbers: a(0) = 1, and for n >= 1, a(n) is either the least divisor of a(n-1) not already present in the sequence, or (if all divisors already used), a(n-1) * {the least prime p such that p does not divide a(n-1) and p*a(n-1) is not already present}.

n	a(n)
0	1
1	2
2	6
3	3
4	15
5	5
6	10
7	30
8	210
9	7
10	14
11	42
12	21
13	105
14	35
15	70
16	770
17	11
18	22
19	66
20	33
21	165
22	55
23	110
24	330
25	2310
26	77
27	154
28	462
29	231
30	1155
31	385
32	5005
33	13
34	26
35	78
36	39
37	195
38	65
39	130
40	390
41	2730
42	91
43	182
44	546
45	273
46	1365
47	455
48	910
49	10010
50	143
51	286
52	858
53	429
54	2145
55	715
56	1430
57	4290
58	30030
59	1001
60	2002
61	6006
62	3003
63	15015
64	255255
65	17
66	34
67	102
68	51
69	255
70	85
71	170
72	510
73	3570
74	119

[1, 2, 6, 3, 15, 5, 10, 30, 210, 7, 14, 42, 21, 105, 35, 70, 770, 11, 22, 66, 33, 165, 55, 110, 330, 2310, 77, 154, 462, 231, 1155, 385, 5005, 13, 26, 78, 39, 195, 65, 130, 390, 2730, 91, 182, 546, 273, 1365, 455, 910, 10010, 143, 286, 858, 429, 2145, 715, 1430, 4290, 30030, 1001, 2002, 6006, 3003, 15015, 255255, 17, 34, 102, 51, 255, 85, 170, 510, 3570, 119]

cp's OEIS Frontend

Table of values

List of values