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.

A325208 a(n) is the number of labeled rooted trees on a set of size n where each node has at most 9 neighbors that are further away from the root than the node itself.

Table of values

n a(n)
0 0
1 1
2 2
3 9
4 64
5 625
6 7776
7 117649
8 2097152
9 43046721
10 1000000000
11 25937424590
12 743008369224
13 23298084997044
14 793714764270428
15 29192925433321650
16 1152921466989795360
17 48661189511753527280
18 2185911410555033096364
19 104127340753401006230046
20 5242879377215160617336400

List of values

[0, 1, 2, 9, 64, 625, 7776, 117649, 2097152, 43046721, 1000000000, 25937424590, 743008369224, 23298084997044, 793714764270428, 29192925433321650, 1152921466989795360, 48661189511753527280, 2185911410555033096364, 104127340753401006230046, 5242879377215160617336400]