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.

A071207 Triangular array T(n,k) read by rows, giving number of rooted trees on the vertex set {1..n+1} where k children of the root have a label smaller than the label of the root.

Table of values

n a(n)
0 1
1 1
2 1
3 4
4 4
5 1
6 27
7 27
8 9
9 1
10 256
11 256
12 96
13 16
14 1
15 3125
16 3125
17 1250
18 250
19 25
20 1
21 46656
22 46656
23 19440
24 4320
25 540
26 36
27 1
28 823543
29 823543
30 352947
31 84035
32 12005
33 1029
34 49
35 1
36 16777216
37 16777216
38 7340032
39 1835008
40 286720
41 28672
42 1792
43 64
44 1
45 387420489

List of values

[1, 1, 1, 4, 4, 1, 27, 27, 9, 1, 256, 256, 96, 16, 1, 3125, 3125, 1250, 250, 25, 1, 46656, 46656, 19440, 4320, 540, 36, 1, 823543, 823543, 352947, 84035, 12005, 1029, 49, 1, 16777216, 16777216, 7340032, 1835008, 286720, 28672, 1792, 64, 1, 387420489]