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.

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

Table of values

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

List of values

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