A303761 - cp's OEIS frontend

A303761 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, or (if all divisors already used), a(n) is obtained by iterating the map x -> x*A053669(x), starting from x = a(n-1), until x is found which is not already present in the sequence.

n	a(n)
0	1
1	2
2	6
3	3
4	30
5	5
6	10
7	210
8	7
9	14
10	42
11	21
12	2310
13	11
14	22
15	66
16	33
17	330
18	15
19	30030
20	13
21	26
22	78
23	39
24	390
25	65
26	130
27	2730
28	35
29	70
30	510510
31	17
32	34
33	102
34	51
35	510
36	85
37	170
38	3570
39	105
40	9699690
41	19
42	38
43	114
44	57
45	570
46	95
47	190
48	3990
49	133
50	266
51	798
52	399
53	43890
54	55
55	110
56	223092870
57	23
58	46
59	138
60	69
61	690
62	115
63	230
64	4830
65	161
66	322
67	966
68	483
69	53130
70	77

[1, 2, 6, 3, 30, 5, 10, 210, 7, 14, 42, 21, 2310, 11, 22, 66, 33, 330, 15, 30030, 13, 26, 78, 39, 390, 65, 130, 2730, 35, 70, 510510, 17, 34, 102, 51, 510, 85, 170, 3570, 105, 9699690, 19, 38, 114, 57, 570, 95, 190, 3990, 133, 266, 798, 399, 43890, 55, 110, 223092870, 23, 46, 138, 69, 690, 115, 230, 4830, 161, 322, 966, 483, 53130, 77]

cp's OEIS Frontend

Table of values

List of values