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.

A196056 Triangle read by rows: T(n,k) is the number of nodes at level k>=1 of the rooted tree having Matula-Goebel number n (n>=2).

Table of values

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

List of values

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