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.

A325206 a(n) is the number of labeled rooted trees on a set of size n where each node has at most 7 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 43046712
10 999999180
11 25937373990
12 743005653984
13 23297946618804
14 793707788417544
15 29192570114517810
16 1152902963147295360
17 48660197610533102880
18 2185856466420637543104
19 104124189019562479248624
20 5242691958381764070687360

List of values

[0, 1, 2, 9, 64, 625, 7776, 117649, 2097152, 43046712, 999999180, 25937373990, 743005653984, 23297946618804, 793707788417544, 29192570114517810, 1152902963147295360, 48660197610533102880, 2185856466420637543104, 104124189019562479248624, 5242691958381764070687360]