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.

A338884 The smallest number of bits which need to be appended to the binary representation of n to reach a prime greater than n.

Table of values

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

List of values

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