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.

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

List of values

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