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.

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

Table of values

n a(n)
10 1
11 0
12 0
13 0
14 0
15 0
16 0
17 0
18 0
19 1
20 2
21 2
22 2
23 2
24 2
25 2
26 2
27 2
28 4
29 7
30 12
31 16
32 21
33 25
34 30
35 34
36 39
37 47
38 61
39 83
40 117
41 160
42 215
43 280
44 356
45 442
46 549
47 682
48 864
49 1112
50 1458
51 1919
52 2533
53 3313
54 4298
55 5521
56 7057
57 8995
58 11497
59 14751
60 19042
61 24687
62 32102
63 41731
64 54172
65 70112
66 90535

List of values

[1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 4, 7, 12, 16, 21, 25, 30, 34, 39, 47, 61, 83, 117, 160, 215, 280, 356, 442, 549, 682, 864, 1112, 1458, 1919, 2533, 3313, 4298, 5521, 7057, 8995, 11497, 14751, 19042, 24687, 32102, 41731, 54172, 70112, 90535]