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.

A110080 a(1) = 1; skipping over integers occurring earlier in the sequence, count down p(n) (p(n) = n-th prime) from a(n) to get a(n+1). If this is <= 0, instead count up from a(n) p(n) positions (skipping already occurring integers) to get a(n+1).

Table of values

n a(n)
1 1
2 3
3 6
4 11
5 2
6 16
7 29
8 10
9 32
10 4
11 39
12 70
13 31
14 75
15 27
16 80
17 20
18 87
19 17
20 94
21 9
22 97
23 176
24 91
25 183
26 81
27 188
28 77
29 193
30 73
31 198
32 57
33 203
34 50
35 206
36 38
37 209
38 28
39 216
40 22
41 223
42 12
43 226
44 417
45 222
46 422
47 219
48 435
49 202
50 440
51 199
52 445
53 190
54 448
55 177
56 455
57 169
58 462
59 166
60 469
61 161
62 472

List of values

[1, 3, 6, 11, 2, 16, 29, 10, 32, 4, 39, 70, 31, 75, 27, 80, 20, 87, 17, 94, 9, 97, 176, 91, 183, 81, 188, 77, 193, 73, 198, 57, 203, 50, 206, 38, 209, 28, 216, 22, 223, 12, 226, 417, 222, 422, 219, 435, 202, 440, 199, 445, 190, 448, 177, 455, 169, 462, 166, 469, 161, 472]