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.

A268696 a(1)=1; thereafter a(n+1) = floor(m/2), where m = number of occurrences of a(n) in [a(1),...,a(n)].

Table of values

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

List of values

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