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.

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

List of values

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