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.

A244457 Number of unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 3.

Table of values

n a(n)
4 1
5 0
6 0
7 1
8 2
9 2
10 4
11 7
12 12
13 20
14 34
15 56
16 98
17 167
18 284
19 484
20 835
21 1433
22 2467
23 4250
24 7345
25 12700
26 22004
27 38154
28 66266
29 115224
30 200623
31 349654
32 610126
33 1065739
34 1863547
35 3261672
36 5714277
37 10020092
38 17586014
39 30890654
40 54305289
41 95542387
42 168221056
43 296401979

List of values

[1, 0, 0, 1, 2, 2, 4, 7, 12, 20, 34, 56, 98, 167, 284, 484, 835, 1433, 2467, 4250, 7345, 12700, 22004, 38154, 66266, 115224, 200623, 349654, 610126, 1065739, 1863547, 3261672, 5714277, 10020092, 17586014, 30890654, 54305289, 95542387, 168221056, 296401979]