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.

A036775 a(n) is the number of labeled rooted trees on a set of size n where each node has at most 3 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 620
6 7620
7 113610
8 1992480
9 40194000
10 916927200
11 23341071600
12 655922836800
13 20169411662400
14 673645440468000
15 24285190867938000
16 939899116892736000
17 38870133445791648000
18 1710655202853140544000
19 79826043011286892320000
20 3936948118406837614080000
21 204621522793150838094720000

List of values

[0, 1, 2, 9, 64, 620, 7620, 113610, 1992480, 40194000, 916927200, 23341071600, 655922836800, 20169411662400, 673645440468000, 24285190867938000, 939899116892736000, 38870133445791648000, 1710655202853140544000, 79826043011286892320000, 3936948118406837614080000, 204621522793150838094720000]

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

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