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.

A363086 a(0)=a(1)=1. For n>1, let c=count of all occurrences of a(n-1) in the list so far. If c < abs(a(n-1)), then a(n)=c-a(n-1). Otherwise, a(n)=c.

Table of values

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

List of values

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