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.

A340733 a(0) = 0; for n > 0, if the value of n itself appears in the sequence then a(n) = a(n-1) - (n-index(n)) if nonnegative and not already in the sequence, otherwise a(n) = a(n-1) + (n-index(n)), where index(n) is the index of the last appearance of n. If the value of n does not appear then a(n) = a(n-1) - n if nonnegative and not already in the sequence, otherwise a(n) = a(n-1) + n.

Table of values

n a(n)
0 0
1 1
2 3
3 2
4 6
5 11
6 9
7 16
8 8
9 5
10 15
11 21
12 33
13 20
14 34
15 29
16 38
17 55
18 37
19 18
20 25
21 35
22 13
23 36
24 12
25 7
26 33
27 60
28 32
29 46
30 76
31 45
32 41
33 48
34 28
35 14
36 27
37 46
38 24
39 63
40 23
41 32
42 74
43 31
44 75
45 61
46 52
47 99
48 84
49 133
50 83
51 134
52 128
53 181
54 127
55 89
56 145
57 88
58 30
59 89
60 56
61 40
62 102
63 78
64 142
65 77
66 143
67 210
68 278
69 209
70 139
71 68

List of values

[0, 1, 3, 2, 6, 11, 9, 16, 8, 5, 15, 21, 33, 20, 34, 29, 38, 55, 37, 18, 25, 35, 13, 36, 12, 7, 33, 60, 32, 46, 76, 45, 41, 48, 28, 14, 27, 46, 24, 63, 23, 32, 74, 31, 75, 61, 52, 99, 84, 133, 83, 134, 128, 181, 127, 89, 145, 88, 30, 89, 56, 40, 102, 78, 142, 77, 143, 210, 278, 209, 139, 68]