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.

A198325 Irregular triangle read by rows: T(n,k) is the number of directed paths of length k (k>=1) in the rooted tree having Matula-Goebel number n (n>=2).

Table of values

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

List of values

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