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.

A255328 a(n) = total number of nodes in the finite subtrees branching "left" (to the "smaller side") from the node n in the infinite trunk of "number-of-runs beanstalk" (A255056).

Table of values

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

List of values

[1, 1, 0, 4, 0, 0, 7, 0, 3, 0, 0, 1, 1, 6, 0, 6, 0, 3, 0, 0, 1, 1, 12, 0, 1, 5, 0, 0, 1, 6, 0, 6, 0, 3, 0, 0, 1, 1, 12, 0, 1, 0, 0, 12, 1, 0, 1, 5, 0, 0, 1, 12, 0, 1, 5, 0, 0, 1, 6, 0, 6, 0, 3, 0, 0, 1, 1, 12, 0, 1, 0, 0, 12, 1, 0, 1, 0, 0, 10, 1, 0, 0, 0, 11, 1, 0, 1, 5, 0, 0, 1, 12, 0, 1, 0, 0, 12, 1, 0, 1, 5, 0, 0, 1, 12, 0, 1, 5, 0, 0, 1, 6, 0, 6, 0, 3, 0, 0, 1]