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.

A162439 Write down the binary representation of n. Partition the string which is this binary representation by placing a '+' just left of every 1. Add the resulting base 2 numbers. a(n) = decimal equivalent of this sum.

Table of values

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

List of values

[1, 2, 2, 4, 3, 3, 3, 8, 5, 4, 4, 5, 4, 4, 4, 16, 9, 6, 6, 6, 5, 5, 5, 9, 6, 5, 5, 6, 5, 5, 5, 32, 17, 10, 10, 8, 7, 7, 7, 10, 7, 6, 6, 7, 6, 6, 6, 17, 10, 7, 7, 7, 6, 6, 6, 10, 7, 6, 6, 7, 6, 6, 6, 64, 33, 18, 18, 12, 11, 11, 11, 12, 9, 8, 8, 9, 8, 8, 8, 18, 11, 8, 8, 8, 7, 7, 7, 11, 8, 7, 7, 8, 7, 7]