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.

A325207 a(n) is the number of labeled rooted trees on a set of size n where each node has at most 8 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 999999990
11 25937423490
12 743008289364
13 23298080054964
14 793714478374818
15 29192909282466930
16 1152920554828545360
17 48661137306426044400
18 2185908358103092063584
19 104127157513055758393026
20 5242868049702388548952080

List of values

[0, 1, 2, 9, 64, 625, 7776, 117649, 2097152, 43046721, 999999990, 25937423490, 743008289364, 23298080054964, 793714478374818, 29192909282466930, 1152920554828545360, 48661137306426044400, 2185908358103092063584, 104127157513055758393026, 5242868049702388548952080]