A323890 - cp's OEIS frontend

A323890 a(1) = 1, a(2) = 2; thereafter a(n+1) = smallest unused divisor of a(n) if there are any, otherwise a(n) + a(n-1).

n	a(n)
1	1
2	2
3	3
4	5
5	8
6	4
7	12
8	6
9	18
10	9
11	27
12	36
13	63
14	7
15	70
16	10
17	80
18	16
19	96
20	24
21	120
22	15
23	135
24	45
25	180
26	20
27	200
28	25
29	225
30	75
31	300
32	30
33	330
34	11
35	341
36	31
37	372
38	62
39	434
40	14
41	448
42	28
43	476
44	17
45	493
46	29
47	522
48	58
49	580
50	116
51	696
52	87
53	783
54	261
55	1044
56	174
57	1218
58	21
59	1239
60	59
61	1298
62	22
63	1320
64	33
65	1353

[1, 2, 3, 5, 8, 4, 12, 6, 18, 9, 27, 36, 63, 7, 70, 10, 80, 16, 96, 24, 120, 15, 135, 45, 180, 20, 200, 25, 225, 75, 300, 30, 330, 11, 341, 31, 372, 62, 434, 14, 448, 28, 476, 17, 493, 29, 522, 58, 580, 116, 696, 87, 783, 261, 1044, 174, 1218, 21, 1239, 59, 1298, 22, 1320, 33, 1353]

cp's OEIS Frontend

A323890 a(1) = 1, a(2) = 2; thereafter a(n+1) = smallest unused divisor of a(n) if there are any, otherwise a(n) + a(n-1).

Table of values

List of values