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.

A068639 a(0) = 0, a(n) = a(n-1) + (-1)^p(n) for n >= 1, where p(n) = highest power of 2 dividing n.

Table of values

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

List of values

[0, 1, 0, 1, 2, 3, 2, 3, 2, 3, 2, 3, 4, 5, 4, 5, 6, 7, 6, 7, 8, 9, 8, 9, 8, 9, 8, 9, 10, 11, 10, 11, 10, 11, 10, 11, 12, 13, 12, 13, 12, 13, 12, 13, 14, 15, 14, 15, 16, 17, 16, 17, 18, 19, 18, 19, 18, 19, 18, 19, 20, 21, 20, 21, 22, 23, 22, 23, 24, 25, 24, 25, 24, 25, 24, 25, 26, 27, 26]