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.

A255704 Number T(n,k) of n-node rooted trees in which the maximal number of nodes in paths starting at a leaf and ending at the first branching node or at the root equals k; triangle T(n,k), n>=1, 1<=k<=n, read by rows.

Table of values

n a(n)
1 1
2 0
3 1
4 0
5 1
6 1
7 0
8 2
9 1
10 1
11 0
12 4
13 3
14 1
15 1
16 0
17 8
18 7
19 3
20 1
21 1
22 0
23 17
24 18
25 8
26 3
27 1
28 1
29 0
30 36
31 45
32 21
33 8
34 3
35 1
36 1
37 0
38 79
39 116
40 56
41 22
42 8
43 3
44 1
45 1
46 0
47 175
48 298
49 152
50 59
51 22
52 8
53 3
54 1
55 1
56 0
57 395
58 776
59 413
60 163
61 60
62 22
63 8
64 3
65 1
66 1
67 0
68 899
69 2025
70 1131
71 450
72 166
73 60
74 22
75 8
76 3
77 1
78 1

List of values

[1, 0, 1, 0, 1, 1, 0, 2, 1, 1, 0, 4, 3, 1, 1, 0, 8, 7, 3, 1, 1, 0, 17, 18, 8, 3, 1, 1, 0, 36, 45, 21, 8, 3, 1, 1, 0, 79, 116, 56, 22, 8, 3, 1, 1, 0, 175, 298, 152, 59, 22, 8, 3, 1, 1, 0, 395, 776, 413, 163, 60, 22, 8, 3, 1, 1, 0, 899, 2025, 1131, 450, 166, 60, 22, 8, 3, 1, 1]