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.

A140100 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 X(n) (for Y(n) see A140101).

Table of values

n a(n)
1 1
2 3
3 4
4 6
5 7
6 9
7 10
8 12
9 14
10 15
11 17
12 18
13 20
14 21
15 23
16 24
17 26
18 27
19 29
20 30
21 32
22 34
23 35
24 37
25 38
26 40
27 41
28 43
29 44
30 46
31 47
32 49
33 51
34 52
35 54
36 55
37 57
38 58
39 60
40 61
41 63
42 64
43 66
44 67
45 69
46 71
47 72
48 74
49 75
50 77
51 78
52 80
53 82
54 83
55 85
56 86
57 88
58 89
59 91
60 92
61 94
62 95
63 97
64 98
65 100
66 102
67 103
68 105
69 106

List of values

[1, 3, 4, 6, 7, 9, 10, 12, 14, 15, 17, 18, 20, 21, 23, 24, 26, 27, 29, 30, 32, 34, 35, 37, 38, 40, 41, 43, 44, 46, 47, 49, 51, 52, 54, 55, 57, 58, 60, 61, 63, 64, 66, 67, 69, 71, 72, 74, 75, 77, 78, 80, 82, 83, 85, 86, 88, 89, 91, 92, 94, 95, 97, 98, 100, 102, 103, 105, 106]