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.

A284188 a(1)=2; thereafter a(n+1) = a(n)+i if a(n) is a prime and a(1),...,a(n) contains i primes, or a(n+1) = a(n)-i if a(n) is composite and a(1),...,a(n) contains i primes.

Table of values

n a(n)
1 2
2 3
3 5
4 8
5 5
6 9
7 5
8 10
9 5
10 11
11 18
12 11
13 19
14 28
15 19
16 29
17 40
18 29
19 41
20 54
21 41
22 55
23 41
24 56
25 41
26 57
27 41
28 58
29 41
30 59
31 78
32 59
33 79
34 100
35 79
36 101
37 124
38 101
39 125
40 101
41 126
42 101
43 127
44 154
45 127
46 155
47 127
48 156
49 127
50 157
51 188
52 157
53 189
54 157
55 190
56 157
57 191
58 226
59 191
60 227
61 264
62 227
63 265

List of values

[2, 3, 5, 8, 5, 9, 5, 10, 5, 11, 18, 11, 19, 28, 19, 29, 40, 29, 41, 54, 41, 55, 41, 56, 41, 57, 41, 58, 41, 59, 78, 59, 79, 100, 79, 101, 124, 101, 125, 101, 126, 101, 127, 154, 127, 155, 127, 156, 127, 157, 188, 157, 189, 157, 190, 157, 191, 226, 191, 227, 264, 227, 265]