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.

A329985 a(1) = 1 and for n > 0, a(n+1) = a(k) - a(n) where k is the number of terms equal to a(n) among the first n terms.

Table of values

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

List of values

[1, 0, 1, -1, 2, -1, 1, 0, 0, 1, -2, 3, -2, 2, -2, 3, -3, 4, -3, 3, -2, 1, 1, -2, 4, -4, 5, -4, 4, -3, 4, -5, 6, -5, 5, -5, 6, -6, 7, -6, 6, -5, 4, -2, 1, 0, -1, 2, -1, 0, 2, -3, 2, 0, -1, 3, -4, 5, -4, 3, -1, 0, 1, -1, 2, -3, 5, -6, 7, -7, 8, -7, 7, -6, 5, -3]