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.

A127538 Triangle read by rows: T(n,k) is the number of ordered trees with n edges having k odd-length branches starting at the root (0<=k<=n).

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 0
5 1
6 0
7 4
8 0
9 1
10 3
11 3
12 7
13 0
14 1
15 3
16 22
17 6
18 10
19 0
20 1
21 16
22 43
23 50
24 9
25 13
26 0
27 1
28 37
29 175
30 101
31 87
32 12
33 16
34 0
35 1
36 134
37 503
38 448
39 177
40 133
41 15
42 19
43 0
44 1
45 411
46 1784
47 1305
48 862
49 271
50 188
51 18
52 22
53 0
54 1
55 1411
56 5887
57 4848
58 2524
59 1444
60 383
61 252
62 21
63 25
64 0
65 1
66 4747
67 20604

List of values

[1, 0, 1, 1, 0, 1, 0, 4, 0, 1, 3, 3, 7, 0, 1, 3, 22, 6, 10, 0, 1, 16, 43, 50, 9, 13, 0, 1, 37, 175, 101, 87, 12, 16, 0, 1, 134, 503, 448, 177, 133, 15, 19, 0, 1, 411, 1784, 1305, 862, 271, 188, 18, 22, 0, 1, 1411, 5887, 4848, 2524, 1444, 383, 252, 21, 25, 0, 1, 4747, 20604]