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.

A255058 Branching degree of node n in the trunk of number-of-runs beanstalk: a(n) = A106836(1+A255057(n)).

Table of values

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

List of values

[3, 3, 1, 4, 2, 1, 4, 1, 3, 2, 1, 4, 3, 4, 1, 3, 1, 3, 2, 1, 4, 3, 4, 1, 3, 3, 1, 3, 3, 4, 1, 3, 1, 3, 2, 1, 4, 3, 4, 1, 3, 3, 2, 4, 4, 1, 3, 3, 1, 3, 3, 4, 1, 3, 3, 1, 3, 3, 4, 1, 3, 1, 3, 2, 1, 4, 3, 4, 1, 3, 3, 2, 4, 4, 1, 3, 3, 2, 4, 4, 1, 1, 2, 3, 4, 1, 3, 3, 1, 3, 3, 4, 1, 3, 3, 2, 4, 4, 1, 3, 3, 1, 3, 3, 4, 1, 3, 3, 1, 3, 3, 4, 1, 3, 1, 3, 2, 1, 4]