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.

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

Table of values

n a(n)
6 1
7 0
8 0
9 0
10 0
11 1
12 2
13 2
14 2
15 2
16 4
17 7
18 12
19 16
20 21
21 29
22 43
23 65
24 99
25 142
26 206
27 297
28 436
29 641
30 945
31 1383
32 2029
33 2976
34 4378
35 6432
36 9464
37 13913
38 20495
39 30205
40 44547
41 65670
42 96846
43 142857
44 210941
45 311636
46 460613
47 680848
48 1006682
49 1488915
50 2203324
51 3261840
52 4830671

List of values

[1, 0, 0, 0, 0, 1, 2, 2, 2, 2, 4, 7, 12, 16, 21, 29, 43, 65, 99, 142, 206, 297, 436, 641, 945, 1383, 2029, 2976, 4378, 6432, 9464, 13913, 20495, 30205, 44547, 65670, 96846, 142857, 210941, 311636, 460613, 680848, 1006682, 1488915, 2203324, 3261840, 4830671]