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.

A340593 a(0) = 0; for n > 0, if n appears in the sequence then a(n) = a(n-1) - lastindex(n) if nonnegative and not already in the sequence, otherwise a(n) = a(n-1) + lastindex(n), where lastindex(n) is the index of the last appearance of n. Otherwise 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 5
4 9
5 6
6 11
7 4
8 12
9 8
10 18
11 24
12 16
13 29
14 15
15 29
16 17
17 33
18 23
19 42
20 22
21 43
22 63
23 45
24 34
25 59
26 85
27 58
28 30
29 45
30 73
31 104
32 72
33 55
34 31
35 66
36 102
37 65
38 27
39 66
40 26
41 67
42 48
43 69
44 25
45 54
46 100
47 53
48 95
49 46
50 96
51 147
52 199
53 152
54 107
55 74
56 130
57 187
58 160
59 135
60 75
61 14
62 76
63 98
64 162
65 125
66 86
67 127
68 195
69 238
70 168
71 97

List of values

[0, 1, 3, 5, 9, 6, 11, 4, 12, 8, 18, 24, 16, 29, 15, 29, 17, 33, 23, 42, 22, 43, 63, 45, 34, 59, 85, 58, 30, 45, 73, 104, 72, 55, 31, 66, 102, 65, 27, 66, 26, 67, 48, 69, 25, 54, 100, 53, 95, 46, 96, 147, 199, 152, 107, 74, 130, 187, 160, 135, 75, 14, 76, 98, 162, 125, 86, 127, 195, 238, 168, 97]