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.

A319416 Cuts-resistance of n: number of applications of Lernormand's "raboter" map needed to transform the binary expansion of n to the empty string.

Table of values

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

List of values

[1, 1, 1, 2, 2, 1, 2, 3, 3, 2, 1, 2, 2, 2, 3, 4, 4, 3, 2, 2, 2, 1, 2, 3, 3, 2, 2, 3, 3, 3, 4, 5, 5, 4, 3, 3, 3, 2, 2, 3, 3, 2, 1, 2, 2, 2, 3, 4, 4, 3, 2, 2, 2, 2, 3, 4, 3, 3, 3, 4, 4, 4, 5, 6, 6, 5, 4, 4, 4, 3, 3, 3, 4, 3, 2, 2, 2, 2, 3, 4, 4, 3, 2, 2, 2, 1, 2]