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.

A331471 Consider the different ways to split the binary representation of n into palindromic parts; a(n) is the greatest possible sum of the parts of such a split.

Table of values

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

List of values

[0, 1, 1, 3, 1, 5, 3, 7, 1, 9, 5, 6, 3, 6, 7, 15, 1, 17, 9, 10, 5, 21, 7, 8, 3, 10, 6, 27, 7, 8, 15, 31, 1, 33, 17, 18, 9, 10, 10, 12, 5, 10, 21, 22, 7, 45, 15, 16, 3, 18, 10, 51, 6, 22, 27, 28, 7, 12, 9, 28, 15, 16, 31, 63, 1, 65, 33, 34, 17, 18, 18, 20, 9, 73]