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.

A321319 Smallest power of 2 obtainable by partitioning the binary representation of n into consecutive blocks and then summing.

Table of values

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

List of values

[1, 1, 2, 1, 2, 2, 4, 1, 2, 2, 4, 2, 4, 4, 4, 1, 2, 2, 4, 2, 4, 4, 4, 2, 4, 4, 4, 4, 4, 4, 16, 1, 2, 2, 4, 2, 4, 4, 4, 2, 4, 4, 4, 4, 4, 4, 8, 2, 4, 4, 4, 4, 4, 4, 8, 4, 4, 4, 8, 4, 8, 8, 8, 1, 2, 2, 4, 2, 4, 4, 4, 2, 4, 4, 4, 4, 4, 4, 8, 2, 4, 4, 4, 4, 4, 4]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.