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.

A103528 a(n) = Sum_{k = 1..n-1 such that n == k (mod 2^k)} 2^(k-1).

Table of values

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

List of values

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