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.

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

Table of values

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

List of values

[0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 4, 1, 0, 0, 0, 0, 0, 1, 0, 4, 1, 0, 0, 1, 0, 0, 4, 1, 0, 0, 0, 0, 0, 1, 0, 4, 1, 0, 0, 1, 7, 1, 0, 3, 0, 1, 0, 0, 4, 1, 0, 0, 1, 0, 0, 4, 1, 0, 0, 0, 0, 0, 1, 0, 4, 1, 0, 0, 1, 7, 1, 0, 3, 0, 1, 7, 1, 0, 16, 0, 0, 1, 0, 3, 0, 1, 0, 0, 4, 1, 0, 0, 1, 7, 1, 0, 3, 0, 1, 0, 0, 4, 1, 0, 0, 1, 0, 0, 4, 1, 0, 0, 0, 0, 0, 1, 0, 4]