A364280 - cp's OEIS frontend

A364280 Lexicographically earliest sequence of distinct positive integers such that a(n) is the least novel multiple of m, the product of all primes q < gpf(a(n-2)a(n-1)) which do not divide a(n-2)a(n-1); a(1) = 1, a(2) = 2.

n	a(n)
1	1
2	2
3	3
4	4
5	5
6	6
7	7
8	10
9	9
10	8
11	11
12	105
13	12
14	13
15	385
16	18
17	14
18	15
19	16
20	17
21	15015
22	20
23	19
24	51051
25	30
26	21
27	22
28	25
29	42
30	23
31	230945
32	84
33	24
34	35
35	26
36	33
37	70
38	27
39	28
40	40
41	36
42	29
43	37182145
44	48
45	31
46	1078282205
47	54
48	32
49	34
50	30030
51	37
52	6678671
53	60060
54	38
55	51
56	5005
57	44
58	39

[1, 2, 3, 4, 5, 6, 7, 10, 9, 8, 11, 105, 12, 13, 385, 18, 14, 15, 16, 17, 15015, 20, 19, 51051, 30, 21, 22, 25, 42, 23, 230945, 84, 24, 35, 26, 33, 70, 27, 28, 40, 36, 29, 37182145, 48, 31, 1078282205, 54, 32, 34, 30030, 37, 6678671, 60060, 38, 51, 5005, 44, 39]

cp's OEIS Frontend

A364280 Lexicographically earliest sequence of distinct positive integers such that a(n) is the least novel multiple of m, the product of all primes q < gpf(a(n-2)a(n-1)) which do not divide a(n-2)a(n-1); a(1) = 1, a(2) = 2.

Table of values

List of values

cp's OEIS Frontend

A364280 Lexicographically earliest sequence of distinct positive integers such that a(n) is the least novel multiple of m, the product of all primes q < gpf(a(n-2)*a(n-1)) which do not divide a(n-2)*a(n-1); a(1) = 1, a(2) = 2.

Table of values

List of values

A364280 Lexicographically earliest sequence of distinct positive integers such that a(n) is the least novel multiple of m, the product of all primes q < gpf(a(n-2)a(n-1)) which do not divide a(n-2)a(n-1); a(1) = 1, a(2) = 2.