cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A167604 A variant of Euclid-Mullin (A000945): a(1)=2, a(n+1) is the least prime dividing [Product_{i in I} a(i) + Product_{i not in I} a(i)], minimized over all subsets I of {1..n}.

Table of values

n a(n)
1 2
2 3
3 5
4 11
5 37
6 13
7 7
8 29
9 17
10 19
11 43
12 23
13 47
14 41
15 53
16 31
17 61
18 59
19 67
20 79
21 83
22 73
23 97
24 71
25 101
26 89
27 103
28 127
29 107
30 113
31 137
32 131
33 139
34 109
35 149
36 151
37 163
38 157
39 167
40 173
41 193
42 211
43 179
44 191
45 181
46 223
47 199
48 197
49 233
50 227
51 229
52 239
53 241
54 251
55 257
56 307
57 281
58 269
59 271
60 293

List of values

[2, 3, 5, 11, 37, 13, 7, 29, 17, 19, 43, 23, 47, 41, 53, 31, 61, 59, 67, 79, 83, 73, 97, 71, 101, 89, 103, 127, 107, 113, 137, 131, 139, 109, 149, 151, 163, 157, 167, 173, 193, 211, 179, 191, 181, 223, 199, 197, 233, 227, 229, 239, 241, 251, 257, 307, 281, 269, 271, 293]