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.

A091991 Minimal number of 1's that must be inserted into the binary representation of n to get a prime.

Table of values

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

List of values

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