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.

A171400 Minimal number of editing steps (delete, insert or substitute) to transform the binary representation of n into that of A007918(n), the least prime not less than n.

Table of values

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

List of values

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