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.

A343332 a(1) = 0; thereafter a(n+1) = floor((a(n)+y)/2), where y is the number of numbers m < n such that a(m) = a(n).

Table of values

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

List of values

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