A304755 - cp's OEIS frontend

A304755 Suspected divisor-or-multiple permutation: a(1) = 1, and for n > 1, a(n) is either the second smallest divisor of a(n-1) not already present in sequence, or the smallest divisor if it is the only one not yet used, or (if all divisors have been already encountered), a(n) = a(n-1) * {the least power of the least prime not dividing a(n-1) such that the term is not already present}.

n	a(n)
1	1
2	2
3	6
4	3
5	12
6	4
7	36
8	18
9	9
10	72
11	24
12	8
13	216
14	54
15	27
16	108
17	540
18	10
19	5
20	20
21	60
22	30
23	15
24	120
25	40
26	360
27	90
28	45
29	180
30	1260
31	14
32	7
33	28
34	84
35	42
36	21
37	168
38	56
39	504
40	126
41	63
42	252
43	6300
44	35
45	70
46	210
47	105
48	420
49	140
50	3780
51	189
52	378
53	1890
54	270
55	135
56	1080
57	7560
58	315
59	630
60	6930
61	22
62	11
63	44
64	132
65	66
66	33
67	264
68	88
69	792
70	198
71	99
72	396
73	1980
74	110
75	55

[1, 2, 6, 3, 12, 4, 36, 18, 9, 72, 24, 8, 216, 54, 27, 108, 540, 10, 5, 20, 60, 30, 15, 120, 40, 360, 90, 45, 180, 1260, 14, 7, 28, 84, 42, 21, 168, 56, 504, 126, 63, 252, 6300, 35, 70, 210, 105, 420, 140, 3780, 189, 378, 1890, 270, 135, 1080, 7560, 315, 630, 6930, 22, 11, 44, 132, 66, 33, 264, 88, 792, 198, 99, 396, 1980, 110, 55]

cp's OEIS Frontend

Table of values

List of values