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.

A349703 Irregular triangle read by rows where T(n,k) is the number of free trees attaining the maximum terminal Wiener index (A349702) for a tree of n vertices among which k are leaves.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 4, 1, 2, 1, 1, 1, 5, 1, 2, 1, 1, 1, 1, 7, 1, 3, 1, 2, 1, 1, 1, 8, 1, 3, 1, 2, 1, 1, 1, 1, 10, 1, 4, 1, 3, 1, 2, 1, 1, 1, 12, 1, 4, 1, 3, 1, 2, 1, 1, 1, 1, 14, 1, 5, 1, 4, 1, 3, 1, 2, 1, 1, 1, 16, 1, 5, 1, 4, 1, 3, 1, 2, 1, 1, 1]