A111267 - cp's OEIS frontend

A111267 Let q(n) = prime(1) + ... + prime(n); a(n) = smallest divisor of q(n) not already in sequence.

n	a(n)
1	1
2	5
3	2
4	17
5	4
6	41
7	29
8	7
9	10
10	3
11	8
12	197
13	14
14	281
15	82
16	127
17	11
18	167
19	71
20	9
21	89
22	113
23	19
24	107
25	20
26	27
27	16
28	457
29	37
30	59
31	40
32	617
33	28
34	709
35	569
36	809
37	34
38	67
39	31
40	21
41	23
42	383
43	214
44	1277
45	38
46	1409
47	317
48	79
49	13
50	43
51	25
52	69
53	22
54	2027
55	3169
56	161
57	6
58	193
59	3709
60	7699
61	26
62	331
63	613
64	8893

[1, 5, 2, 17, 4, 41, 29, 7, 10, 3, 8, 197, 14, 281, 82, 127, 11, 167, 71, 9, 89, 113, 19, 107, 20, 27, 16, 457, 37, 59, 40, 617, 28, 709, 569, 809, 34, 67, 31, 21, 23, 383, 214, 1277, 38, 1409, 317, 79, 13, 43, 25, 69, 22, 2027, 3169, 161, 6, 193, 3709, 7699, 26, 331, 613, 8893]

cp's OEIS Frontend

A111267 Let q(n) = prime(1) + ... + prime(n); a(n) = smallest divisor of q(n) not already in sequence.

Table of values

List of values