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.

A072339 Any number n can be written (in two ways, one with m even and one with m odd) in the form n = 2^k_1 - 2^k_2 + 2^k_3 - ... + 2^k_m where the signs alternate and k_1 > k_2 > k_3 > ... >k_m >= 0; sequence gives minimal value of m.

Table of values

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

List of values

[1, 1, 2, 1, 3, 2, 2, 1, 3, 3, 4, 2, 3, 2, 2, 1, 3, 3, 4, 3, 5, 4, 4, 2, 3, 3, 4, 2, 3, 2, 2, 1, 3, 3, 4, 3, 5, 4, 4, 3, 5, 5, 6, 4, 5, 4, 4, 2, 3, 3, 4, 3, 5, 4, 4, 2, 3, 3, 4, 2, 3, 2, 2, 1, 3, 3, 4, 3, 5, 4, 4, 3, 5, 5, 6, 4, 5, 4, 4, 3, 5, 5, 6, 5, 7, 6, 6, 4, 5, 5, 6, 4, 5, 4, 4, 2, 3, 3, 4, 3, 5, 4, 4, 3, 5]