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.

A138158 Triangle read by rows: T(n,k) is the number of ordered trees with n edges and path length k; 0 <= k <= n(n+1)/2.

Table of values

n a(n)
0 1
1 0
2 1
3 0
4 0
5 1
6 1
7 0
8 0
9 0
10 1
11 2
12 1
13 1
14 0
15 0
16 0
17 0
18 1
19 3
20 3
21 3
22 2
23 1
24 1
25 0
26 0
27 0
28 0
29 0
30 1
31 4
32 6
33 7
34 7
35 5
36 5
37 3
38 2
39 1
40 1
41 0
42 0
43 0
44 0
45 0
46 0
47 1
48 5
49 10
50 14
51 17
52 16
53 16
54 14
55 11
56 9
57 7
58 5
59 3
60 2
61 1
62 1
63 0
64 0
65 0
66 0
67 0
68 0
69 0
70 1
71 6
72 15
73 25
74 35
75 40
76 43
77 44
78 40
79 37
80 32
81 28
82 22
83 18
84 13
85 11
86 7
87 5
88 3
89 2
90 1
91 1

List of values

[1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 2, 1, 1, 0, 0, 0, 0, 1, 3, 3, 3, 2, 1, 1, 0, 0, 0, 0, 0, 1, 4, 6, 7, 7, 5, 5, 3, 2, 1, 1, 0, 0, 0, 0, 0, 0, 1, 5, 10, 14, 17, 16, 16, 14, 11, 9, 7, 5, 3, 2, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 6, 15, 25, 35, 40, 43, 44, 40, 37, 32, 28, 22, 18, 13, 11, 7, 5, 3, 2, 1, 1]