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.

A212627 Irregular triangle read by rows: T(n,k) is the number of maximal independent vertex subsets with k vertices of the rooted tree with Matula-Goebel number n (n>=1, k>=1).

Table of values

n a(n)
1 1
2 2
3 1
4 1
5 1
6 1
7 0
8 3
9 0
10 3
11 1
12 0
13 1
14 1
15 0
16 1
17 0
18 3
19 1
20 0
21 3
22 1
23 0
24 3
25 1
26 0
27 1
28 2
29 0
30 1
31 2
32 0
33 1
34 2
35 0
36 1
37 4
38 1
39 0
40 0
41 1
42 0
43 1
44 2
45 0
46 0
47 5
48 1
49 0
50 0
51 1
52 0
53 2
54 1
55 1
56 0
57 2
58 1
59 1
60 0
61 1
62 4
63 0
64 0
65 5
66 0
67 1
68 0
69 2
70 0
71 0
72 6
73 1
74 0
75 0
76 5
77 0
78 0
79 7
80 1
81 0
82 0
83 2
84 1
85 0
86 2
87 1
88 1
89 0
90 0
91 4
92 2
93 0
94 1
95 4
96 1
97 0
98 0
99 0
100 1
101 0
102 0
103 6
104 1
105 0
106 2
107 1
108 1
109 0
110 1
111 1
112 3
113 0
114 0
115 1
116 4
117 0
118 1
119 0
120 2
121 0
122 1
123 0
124 2
125 0
126 0
127 4
128 2
129 0
130 2
131 0
132 1
133 1
134 0
135 0
136 5
137 0
138 0
139 2
140 3
141 0
142 0
143 2
144 1
145 0
146 1
147 1
148 3
149 0
150 0
151 3
152 6

List of values

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