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.

A337835 a(1) = 0 and for n > 1, a(n+1) = 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 0
2 1
3 0
4 2
5 -1
6 2
7 0
8 3
9 -2
10 3
11 -1
12 3
13 0
14 4
15 -3
16 4
17 -2
18 4
19 -1
20 4
21 0
22 5
23 -4
24 5
25 -3
26 5
27 -2
28 5
29 -1
30 5
31 0
32 6
33 -5
34 6
35 -4
36 6
37 -3
38 6
39 -2
40 6
41 -1
42 6
43 0
44 7
45 -6
46 7
47 -5
48 7
49 -4
50 7
51 -3
52 7
53 -2
54 7
55 -1
56 7
57 0
58 8
59 -7
60 8
61 -6
62 8
63 -5
64 8
65 -4
66 8
67 -3
68 8
69 -2
70 8
71 -1
72 8
73 0
74 9
75 -8
76 9
77 -7
78 9
79 -6
80 9
81 -5
82 9
83 -4
84 9
85 -3
86 9

List of values

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