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.

A144477 a(n) = minimal number of 0's that must be changed to 1's in the binary expansion of the n-th prime in order to make it into a palindrome.

Table of values

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

List of values

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