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.

A308551 Start with an empty stack S; for n = 1, 2, 3, ..., interpret the binary representation of n from left to right as follows: in case of bit 1, push the number 1 on top of S, in case of bit 0, replace the two numbers on top of S with their sum; a(n) gives the number on top of S after processing n.

Table of values

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

List of values

[1, 2, 1, 3, 1, 2, 1, 4, 1, 3, 1, 3, 1, 2, 1, 5, 1, 12, 1, 4, 1, 2, 1, 4, 1, 3, 1, 3, 1, 2, 1, 6, 1, 15, 1, 23, 1, 2, 1, 5, 1, 4, 1, 4, 1, 2, 1, 5, 1, 4, 1, 4, 1, 2, 1, 4, 1, 3, 1, 3, 1, 2, 1, 7, 1, 19, 1, 30, 1, 2, 1, 47, 1, 57, 1, 5, 1, 2, 1, 6, 1, 20, 1, 5]