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.

A280875 Set a(1)=0, a(2)=1, a(3)=3; b(1)=1, b(2)=2; c(1)=3. Thereafter, a(n) is the smallest positive integer m such that m is not yet in sequence a, m-a(n-1) is not yet in sequence b, and m-a(n-2) is not yet in sequence c; set b(n-1)=m-a(n-1), c(n-2)=m-a(n-2).

Table of values

n a(n)
1 0
2 1
3 3
4 2
5 5
6 9
7 4
8 13
9 10
10 6
11 18
12 11
13 16
14 7
15 25
16 17
17 15
18 28
19 12
20 19
21 27
22 8
23 14
24 24
25 35
26 49
27 20
28 37
29 52
30 21
31 44
32 33
33 23
34 47
35 41
36 29
37 54
38 70
39 22
40 42
41 61
42 36
43 78
44 31
45 53
46 74
47 30
48 57
49 83
50 26
51 56
52 84
53 32
54 64
55 51
56 34
57 71
58 100
59 38
60 81
61 60
62 40
63 86
64 63
65 39
66 87
67 69
68 43

List of values

[0, 1, 3, 2, 5, 9, 4, 13, 10, 6, 18, 11, 16, 7, 25, 17, 15, 28, 12, 19, 27, 8, 14, 24, 35, 49, 20, 37, 52, 21, 44, 33, 23, 47, 41, 29, 54, 70, 22, 42, 61, 36, 78, 31, 53, 74, 30, 57, 83, 26, 56, 84, 32, 64, 51, 34, 71, 100, 38, 81, 60, 40, 86, 63, 39, 87, 69, 43]