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.

A305445 Minimum number of bit inversions to convert n into a prime.

Table of values

n a(n)
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 2
15 1
16 1
17 0
18 1
19 0
20 2
21 1
22 1
23 0
24 2
25 1
26 2
27 1
28 1
29 0
30 1
31 0
32 2
33 1
34 1
35 1
36 1
37 0
38 2
39 1
40 1
41 0
42 1
43 0
44 2
45 1
46 1
47 0
48 2
49 1
50 2
51 1
52 1
53 0
54 2
55 1
56 2
57 1
58 1
59 0
60 1
61 0
62 2
63 1
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 3
85 2
86 2
87 1
88 1
89 0
90 2
91 1
92 2
93 1
94 2
95 1
96 1
97 0
98 2
99 1
100 1
101 0
102 1
103 0
104 2
105 1
106 1

List of values

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