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.

A364835 a(1) = 1; a(n+1) = (number of times a(n)+1 has appeared) - (number of times a(n) has appeared).

Table of values

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

List of values

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