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.

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

Table of values

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

List of values

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