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.

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

List of values

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