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.

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

Table of values

n a(n)
5 1
6 0
7 0
8 0
9 1
10 2
11 2
12 2
13 4
14 7
15 12
16 16
17 25
18 38
19 61
20 94
21 147
22 227
23 356
24 550
25 862
26 1345
27 2113
28 3299
29 5168
30 8091
31 12721
32 19981
33 31421
34 49384
35 77761
36 122487
37 193151
38 304623
39 480852
40 759367
41 1200150
42 1897594
43 3002329
44 4752436
45 7527155
46 11927290
47 18909719
48 29993579

List of values

[1, 0, 0, 0, 1, 2, 2, 2, 4, 7, 12, 16, 25, 38, 61, 94, 147, 227, 356, 550, 862, 1345, 2113, 3299, 5168, 8091, 12721, 19981, 31421, 49384, 77761, 122487, 193151, 304623, 480852, 759367, 1200150, 1897594, 3002329, 4752436, 7527155, 11927290, 18909719, 29993579]