A304531 - cp's OEIS frontend

A304531 Suspected divisor-or-multiple permutation: a(1) = 1, and for n > 1, a(n) is either the least unitary divisor of a(n-1) not already present, or (if all unitary divisors already used), 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	9
9	18
10	90
11	5
12	10
13	30
14	15
15	60
16	20
17	180
18	45
19	360
20	8
21	24
22	120
23	40
24	1080
25	27
26	54
27	270
28	135
29	540
30	108
31	2700
32	25
33	50
34	150
35	75
36	300
37	100
38	900
39	225
40	450
41	3150
42	7
43	14
44	42
45	21
46	84
47	28
48	252
49	63
50	126
51	630
52	35
53	70
54	210
55	105
56	420
57	140
58	1260
59	315
60	2520
61	56
62	168
63	840
64	280
65	7560
66	189
67	378
68	1890
69	945
70	3780
71	756
72	18900
73	175
74	350
75	1050
76	525
77	2100
78	700

[1, 2, 6, 3, 12, 4, 36, 9, 18, 90, 5, 10, 30, 15, 60, 20, 180, 45, 360, 8, 24, 120, 40, 1080, 27, 54, 270, 135, 540, 108, 2700, 25, 50, 150, 75, 300, 100, 900, 225, 450, 3150, 7, 14, 42, 21, 84, 28, 252, 63, 126, 630, 35, 70, 210, 105, 420, 140, 1260, 315, 2520, 56, 168, 840, 280, 7560, 189, 378, 1890, 945, 3780, 756, 18900, 175, 350, 1050, 525, 2100, 700]

cp's OEIS Frontend

Table of values

List of values