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.

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

Table of values

n a(n)
9 1
10 0
11 0
12 0
13 0
14 0
15 0
16 0
17 1
18 2
19 2
20 2
21 2
22 2
23 2
24 2
25 4
26 7
27 12
28 16
29 21
30 25
31 30
32 34
33 43
34 56
35 79
36 112
37 156
38 210
39 276
40 351
41 447
42 570
43 741
44 978
45 1314
46 1764
47 2367
48 3137
49 4131
50 5398
51 7058
52 9236
53 12161
54 16077
55 21340
56 28326
57 37573
58 49696
59 65623
60 86526
61 114122
62 150624

List of values

[1, 0, 0, 0, 0, 0, 0, 0, 1, 2, 2, 2, 2, 2, 2, 2, 4, 7, 12, 16, 21, 25, 30, 34, 43, 56, 79, 112, 156, 210, 276, 351, 447, 570, 741, 978, 1314, 1764, 2367, 3137, 4131, 5398, 7058, 9236, 12161, 16077, 21340, 28326, 37573, 49696, 65623, 86526, 114122, 150624]