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.

A127529 Triangle read by rows: T(n,k) is the number of ordered trees with n edges and jump-length equal to k (n >= 0, 0 <= k <= n-2).

Table of values

n a(n)
0 1
1 1
2 2
3 4
4 1
5 8
6 5
7 1
8 16
9 17
10 8
11 1
12 32
13 49
14 38
15 12
16 1
17 64
18 129
19 141
20 77
21 17
22 1
23 128
24 321
25 453
26 361
27 143
28 23
29 1
30 256
31 769
32 1326
33 1399
34 834
35 247
36 30
37 1
38 512
39 1793
40 3640
41 4776
42 3869
43 1765
44 402
45 38
46 1
47 1024
48 4097
49 9539
50 14911
51 15353
52 9722
53 3469
54 623
55 47
56 1
57 2048
58 9217

List of values

[1, 1, 2, 4, 1, 8, 5, 1, 16, 17, 8, 1, 32, 49, 38, 12, 1, 64, 129, 141, 77, 17, 1, 128, 321, 453, 361, 143, 23, 1, 256, 769, 1326, 1399, 834, 247, 30, 1, 512, 1793, 3640, 4776, 3869, 1765, 402, 38, 1, 1024, 4097, 9539, 14911, 15353, 9722, 3469, 623, 47, 1, 2048, 9217]