A109890 - cp's OEIS frontend

A109890 a(1)=1; for n>1, a(n) is the smallest number not already present which is a divisor or a multiple of a(1)+...+a(n-1).

n	a(n)
1	1
2	2
3	3
4	6
5	4
6	8
7	12
8	9
9	5
10	10
11	15
12	25
13	20
14	24
15	16
16	32
17	48
18	30
19	18
20	36
21	27
22	13
23	7
24	53
25	106
26	265
27	159
28	318
29	212
30	14
31	107
32	321
33	214
34	428
35	642
36	535
37	35
38	21
39	181
40	11
41	33
42	22
43	23
44	59
45	70
46	28
47	151
48	29
49	19
50	233
51	466
52	2563
53	699
54	932
55	40
56	26
57	38
58	31
59	61
60	39
61	49
62	98
63	42

[1, 2, 3, 6, 4, 8, 12, 9, 5, 10, 15, 25, 20, 24, 16, 32, 48, 30, 18, 36, 27, 13, 7, 53, 106, 265, 159, 318, 212, 14, 107, 321, 214, 428, 642, 535, 35, 21, 181, 11, 33, 22, 23, 59, 70, 28, 151, 29, 19, 233, 466, 2563, 699, 932, 40, 26, 38, 31, 61, 39, 49, 98, 42]

cp's OEIS Frontend

A109890 a(1)=1; for n>1, a(n) is the smallest number not already present which is a divisor or a multiple of a(1)+...+a(n-1).

Table of values

List of values