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.

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

Table of values

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

List of values

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