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.

A092111 a(n) = n+1 minus the greatest number of 1's in the binary representations of primes between 2^n and 2^(n+1).

Table of values

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

List of values

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