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.

A359504 a(n) is calculated by considering in ascending order all products P of zero or more terms from {a(1..n-1)} until finding one where P+1 has a prime factor not in {a(1..n-1)}, in which case a(n) is the smallest such prime factor.

Table of values

n a(n)
1 2
2 3
3 7
4 5
5 11
6 23
7 31
8 17
9 43
10 47
11 13
12 67
13 71
14 79
15 29
16 59
17 19
18 103
19 53
20 107
21 37
22 131
23 139
24 73
25 83
26 167
27 89
28 179
29 61
30 41
31 191
32 101
33 211
34 109
35 223
36 239
37 127
38 263
39 137
40 283
41 97
42 151
43 311
44 331
45 173
46 347
47 359
48 367
49 383
50 193
51 197
52 419
53 431
54 439
55 443
56 149
57 113
58 227
59 463

List of values

[2, 3, 7, 5, 11, 23, 31, 17, 43, 47, 13, 67, 71, 79, 29, 59, 19, 103, 53, 107, 37, 131, 139, 73, 83, 167, 89, 179, 61, 41, 191, 101, 211, 109, 223, 239, 127, 263, 137, 283, 97, 151, 311, 331, 173, 347, 359, 367, 383, 193, 197, 419, 431, 439, 443, 149, 113, 227, 463]