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.

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

List of values

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