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.

A278516 Number of children the n-th node (counted from the root 0) has in the infinite trunk of least squares beanstalk tree: a(n) = A278216(A276573(n)).

Table of values

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

List of values

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