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.

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

Table of values

n a(n)
11 1
12 0
13 0
14 0
15 0
16 0
17 0
18 0
19 0
20 0
21 1
22 2
23 2
24 2
25 2
26 2
27 2
28 2
29 2
30 2
31 4
32 7
33 12
34 16
35 21
36 25
37 30
38 34
39 39
40 43
41 52
42 65
43 88
44 121
45 165
46 219
47 285
48 360
49 447
50 544
51 661
52 805
53 998
54 1256
55 1613
56 2085
57 2709
58 3500
59 4496
60 5709
61 7201
62 9016
63 11277
64 14108
65 17738
66 22410
67 28484
68 36330

List of values

[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 7, 12, 16, 21, 25, 30, 34, 39, 43, 52, 65, 88, 121, 165, 219, 285, 360, 447, 544, 661, 805, 998, 1256, 1613, 2085, 2709, 3500, 4496, 5709, 7201, 9016, 11277, 14108, 17738, 22410, 28484, 36330]