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.

A325205 a(n) is the number of labeled rooted trees on a set of size n where each node has at most 6 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 2097144
9 43046136
10 999970020
11 25936053990
12 742947675624
13 23295384644532
14 793591829158128
15 29187143427692250
16 1152639088016576160
17 48646833059722978080
18 2185150741063924810176
19 104085328898784937079376
20 5240461483486301616704160

List of values

[0, 1, 2, 9, 64, 625, 7776, 117649, 2097144, 43046136, 999970020, 25936053990, 742947675624, 23295384644532, 793591829158128, 29187143427692250, 1152639088016576160, 48646833059722978080, 2185150741063924810176, 104085328898784937079376, 5240461483486301616704160]