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.

A244538 Number of ordered 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 9
20 19
21 20
22 21
23 22
24 23
25 24
26 25
27 26
28 144
29 406
30 841
31 1335
32 1891
33 2512
34 3201
35 3961
36 4795
37 7491
38 14467
39 28861
40 54626
41 94160
42 150101
43 225337
44 323016
45 446556
46 629454
47 949486
48 1545877
49 2639756
50 4558225
51 7716325
52 12629776
53 19928727
54 30372551

List of values

[1, 0, 0, 0, 0, 0, 0, 0, 0, 9, 19, 20, 21, 22, 23, 24, 25, 26, 144, 406, 841, 1335, 1891, 2512, 3201, 3961, 4795, 7491, 14467, 28861, 54626, 94160, 150101, 225337, 323016, 446556, 629454, 949486, 1545877, 2639756, 4558225, 7716325, 12629776, 19928727, 30372551]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.