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.

A140101 Start with Y(0)=0, X(1)=1, Y(1)=2. For n > 1, choose least positive integers Y(n) > X(n) such that neither Y(n) nor X(n) appear in {Y(k), 1 <= k < n} or {X(k), 1 <= k < n} and such that Y(n)-X(n) does not appear in {Y(k)-X(k), 1 <= k < n} or {Y(k)+X(k), 1 <= k < n}; sequence gives Y(n) (for X(n) see A140100).

Table of values

n a(n)
0 0
1 2
2 5
3 8
4 11
5 13
6 16
7 19
8 22
9 25
10 28
11 31
12 33
13 36
14 39
15 42
16 45
17 48
18 50
19 53
20 56
21 59
22 62
23 65
24 68
25 70
26 73
27 76
28 79
29 81
30 84
31 87
32 90
33 93
34 96
35 99
36 101
37 104
38 107
39 110
40 113
41 116
42 118
43 121
44 124
45 127
46 130
47 133
48 136
49 138
50 141
51 144
52 147
53 150
54 153
55 156
56 158
57 161
58 164
59 167
60 170
61 173

List of values

[0, 2, 5, 8, 11, 13, 16, 19, 22, 25, 28, 31, 33, 36, 39, 42, 45, 48, 50, 53, 56, 59, 62, 65, 68, 70, 73, 76, 79, 81, 84, 87, 90, 93, 96, 99, 101, 104, 107, 110, 113, 116, 118, 121, 124, 127, 130, 133, 136, 138, 141, 144, 147, 150, 153, 156, 158, 161, 164, 167, 170, 173]