A303762 - cp's OEIS frontend

A303762 a(0) = 1, and for n >= 1, a(n) is either the largest 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	105
10	35
11	7
12	14
13	42
14	21
15	231
16	77
17	11
18	22
19	66
20	33
21	165
22	55
23	110
24	330
25	2310
26	1155
27	385
28	770
29	154
30	462
31	6006
32	3003
33	1001
34	143
35	13
36	26
37	78
38	39
39	195
40	65
41	130
42	390
43	2730
44	1365
45	455
46	91
47	182
48	546
49	273
50	4641
51	1547
52	221
53	17
54	34
55	102
56	51
57	255
58	85
59	170
60	510
61	3570
62	1785
63	595
64	119
65	238
66	714
67	357
68	3927
69	1309
70	187
71	374
72	1122
73	561
74	2805
75	935

[1, 2, 6, 3, 15, 5, 10, 30, 210, 105, 35, 7, 14, 42, 21, 231, 77, 11, 22, 66, 33, 165, 55, 110, 330, 2310, 1155, 385, 770, 154, 462, 6006, 3003, 1001, 143, 13, 26, 78, 39, 195, 65, 130, 390, 2730, 1365, 455, 91, 182, 546, 273, 4641, 1547, 221, 17, 34, 102, 51, 255, 85, 170, 510, 3570, 1785, 595, 119, 238, 714, 357, 3927, 1309, 187, 374, 1122, 561, 2805, 935]

cp's OEIS Frontend

A303762 a(0) = 1, and for n >= 1, a(n) is either the largest 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}.

Table of values

List of values