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.

A091935 Smallest number of 1's in binary representations of primes between 2^n and 2^(n+1).

Table of values

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

List of values

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