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.

A352961 a(0) = 0, a(1) = 1, and for any n > 1, a(n) = a(n-2^e) + a(n-2^(e+1)) with e as large as possible (e = A070939(n) - 2).

Table of values

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

List of values

[0, 1, 1, 2, 1, 3, 2, 5, 1, 4, 3, 7, 2, 7, 5, 12, 1, 5, 4, 9, 3, 10, 7, 17, 2, 9, 7, 16, 5, 17, 12, 29, 1, 6, 5, 11, 4, 13, 9, 22, 3, 13, 10, 23, 7, 24, 17, 41, 2, 11, 9, 20, 7, 23, 16, 39, 5, 22, 17, 39, 12, 41, 29, 70, 1, 7, 6, 13, 5, 16, 11, 27, 4, 17, 13]