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.

A103185 a(n) = Sum_{ k >= 0 such that n + k == 0 mod 2^k } 2^(k-1).

Table of values

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

List of values

[0, 1, 2, 1, 0, 5, 2, 1, 0, 1, 2, 1, 8, 5, 2, 1, 0, 1, 2, 1, 0, 5, 2, 1, 0, 1, 2, 17, 8, 5, 2, 1, 0, 1, 2, 1, 0, 5, 2, 1, 0, 1, 2, 1, 8, 5, 2, 1, 0, 1, 2, 1, 0, 5, 2, 1, 0, 1, 34, 17, 8, 5, 2, 1, 0, 1, 2, 1, 0, 5, 2, 1, 0, 1, 2, 1, 8, 5, 2, 1, 0, 1, 2, 1, 0, 5, 2, 1, 0, 1, 2, 17, 8, 5, 2, 1, 0, 1, 2, 1, 0, 5, 2, 1]