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.

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

Table of values

n a(n)
7 1
8 0
9 0
10 0
11 0
12 0
13 1
14 2
15 2
16 2
17 2
18 2
19 4
20 7
21 12
22 16
23 21
24 25
25 34
26 47
27 70
28 103
29 147
30 201
31 276
32 377
33 527
34 743
35 1057
36 1486
37 2088
38 2911
39 4073
40 5704
41 8027
42 11290
43 15897
44 22340
45 31411
46 44159
47 62165
48 87516
49 123296
50 173642
51 244636
52 344684
53 485976
54 685362
55 966971
56 1364301

List of values

[1, 0, 0, 0, 0, 0, 1, 2, 2, 2, 2, 2, 4, 7, 12, 16, 21, 25, 34, 47, 70, 103, 147, 201, 276, 377, 527, 743, 1057, 1486, 2088, 2911, 4073, 5704, 8027, 11290, 15897, 22340, 31411, 44159, 62165, 87516, 123296, 173642, 244636, 344684, 485976, 685362, 966971, 1364301]